perm filename S84.IN[LET,JMC] blob
sn#762078 filedate 1984-07-03 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00502 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00051 00002 ∂01-Apr-84 1409 DEK NEWS UPDATE FROM CHAIRPERSON SEARCH COMMITTEE!
C00055 00003 ∂01-Apr-84 1839 reiter%ubc.csnet@csnet-relay.arpa workshop
C00061 00004 ∂02-Apr-84 0736 KJB@SRI-AI.ARPA
C00062 00005 ∂02-Apr-84 0811 PHY
C00063 00006 ∂02-Apr-84 1512 MULLER@SU-SCORE.ARPA EKL / Sail account.
C00065 00007 ∂02-Apr-84 1632 GOTELLI@SU-SCORE.ARPA [John McCarthy <JMC@SU-AI.ARPA>:]
C00067 00008 ∂02-Apr-84 1734 ROODE@SRI-NIC.ARPA AAAI Repository
C00069 00009 ∂02-Apr-84 2151 Newman.ES@Xerox.ARPA military funding of computer research
C00073 00010 ∂03-Apr-84 0017 reid@su-glacier Re: dictionary or word list
C00075 00011 ∂03-Apr-84 0809 DFH CS258 computer accounts
C00076 00012 ∂03-Apr-84 0900 JMC*
C00077 00013 ∂03-Apr-84 0912 MULLER@SU-SCORE.ARPA
C00078 00014 ∂03-Apr-84 0927 HULL@SU-SCORE.ARPA Military research spending
C00081 00015 ∂03-Apr-84 0927 PHY Search Comm.
C00082 00016 ∂03-Apr-84 1012 BUCHANAN@SUMEX-AIM.ARPA D.Lenat's forms
C00083 00017 ∂03-Apr-84 1326 PHY
C00084 00018 ∂03-Apr-84 1706 YOM
C00085 00019 ∂03-Apr-84 1717 SCHREIBER@SU-SCORE.ARPA Welcome Tom Binford!
C00087 00020 ∂03-Apr-84 1848 YOM
C00089 00021 ∂03-Apr-84 1856 GROSOF@SUMEX-AIM.ARPA ANNOUNCING: NONMONOTONIC REASONING SEMINAR first meeting is 4/11
C00093 00022 ∂03-Apr-84 2015 CL.BOYER@UTEXAS-20.ARPA re: ultimate dictionary (from SAIL's BBOARD)
C00095 00023 ∂03-Apr-84 2235 WIEDERHOLD@SUMEX-AIM.ARPA Re: SAIL accounts
C00096 00024 ∂03-Apr-84 2301 WIEDERHOLD@SUMEX-AIM.ARPA
C00098 00025 ∂04-Apr-84 1602 EMMA@SU-CSLI.ARPA
C00100 00026 ∂04-Apr-84 1811 JK ekl
C00101 00027 ∂05-Apr-84 0714 perlis%umcp-cs.csnet@csnet-relay.arpa nonmonotonic reference request
C00103 00028 ∂05-Apr-84 1350 PHY
C00104 00029 ∂05-Apr-84 1518 ME DD installation
C00105 00030 ∂06-Apr-84 0808 BUCHANAN@SUMEX-AIM.ARPA NO SIGLUNCH TODAY
C00106 00031 ∂06-Apr-84 1014 SCHREIBER@SU-SCORE.ARPA comp questions--pick up today
C00108 00032 ∂06-Apr-84 1026 BSCOTT@SU-SCORE.ARPA Re: secretary
C00111 00033 ∂06-Apr-84 1129 REGES@SU-SCORE.ARPA Computer Accounts
C00114 00034 ∂06-Apr-84 1515 JAMIE@SU-CSLI.ARPA visitor Veronica Dahl
C00115 00035 ∂06-Apr-84 1531 reiter%ubc.csnet@csnet-relay.arpa Request for paper
C00117 00036 ∂06-Apr-84 1531 reiter%ubc.csnet@csnet-relay.arpa Stanford visit
C00120 00037 ∂08-Apr-84 2316 ME Prancing Pony Bill
C00122 00038 ∂09-Apr-84 0900 JMC*
C00123 00039 ∂09-Apr-84 0900 JMC*
C00125 00040 ∂09-Apr-84 1534 FAGIN.SJRLVM1%ibm-sj.csnet@csnet-relay.arpa Mail to Yorktown
C00127 00041 ∂09-Apr-84 1744 LEP ekl proof
C00129 00042 ∂10-Apr-84 0104 JIML@SU-SCORE.ARPA re: Undergraduates, and CS (from SAIL's BBOARD)
C00131 00043 ∂10-Apr-84 0420 BRADFORD@SU-SIERRA.ARPA Math Sci. as undergrad C.S.
C00133 00044 ∂10-Apr-84 0711 SCHREIBER@SU-SCORE.ARPA Meeting
C00135 00045 ∂10-Apr-84 0823 BUCHANAN@SUMEX-AIM.ARPA Siglunch on Friday
C00137 00046 ∂10-Apr-84 1648 X.JIML@[36.40.0.209]
C00138 00047 ∂10-Apr-84 1703 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
C00139 00048 ∂10-Apr-84 2313 GROSOF@SUMEX-AIM.ARPA nonmonotonic reasoning seminar meets today
C00140 00049 ∂11-Apr-84 0749 PHY
C00141 00050 ∂11-Apr-84 0828 DFH nonmonotonic file copies
C00142 00051 ∂11-Apr-84 0830 BUCHANAN@SUMEX-AIM.ARPA
C00144 00052 ∂11-Apr-84 1101 BUCHANAN@SUMEX-AIM.ARPA
C00146 00053 ∂11-Apr-84 1204 GROSOF@SUMEX-AIM.ARPA Re: name
C00147 00054 ∂11-Apr-84 1442 DFH Facilities Committee Meeting
C00148 00055 ∂11-Apr-84 1740 DEK PARTY! PARTY! PARTY!
C00150 00056 ∂11-Apr-84 2023 TRACY@SU-SCORE.ARPA pretakers
C00153 00057 ∂12-Apr-84 0000 BUCHANAN@SUMEX-AIM.ARPA
C00154 00058 ∂12-Apr-84 0954 RPG 3600's
C00157 00059 ∂12-Apr-84 1015 RPG
C00158 00060 ∂12-Apr-84 1033 RPG E/Lisp conference
C00159 00061 ∂12-Apr-84 1209 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
C00161 00062 ∂12-Apr-84 1231 ASHOK@SU-SCORE.ARPA Advanced Reading and Research
C00163 00063 ∂12-Apr-84 1511 DFH Leslie Pack
C00164 00064 ∂12-Apr-84 1554 PACK@SU-SCORE.ARPA
C00166 00065 ∂12-Apr-84 1626 DFH
C00167 00066 ∂12-Apr-84 2139 reid@Glacier
C00169 00067 ∂12-Apr-84 2205 FEIGENBAUM@SUMEX-AIM.ARPA Re: SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
C00170 00068 ∂12-Apr-84 2311 vardi@Diablo Talk
C00172 00069 ∂13-Apr-84 1015 SCHREIBER@SU-SCORE.ARPA Pretesting
C00174 00070 ∂13-Apr-84 1502 minker%umcp-cs.csnet@csnet-relay.arpa Math Year at Maryland
C00180 00071 ∂13-Apr-84 1603 GOGUEN@SRI-AI.ARPA
C00181 00072 ∂13-Apr-84 1604 SJG my future
C00182 00073 ∂13-Apr-84 1713 DFH phone messages
C00183 00074 ∂14-Apr-84 1507 GROSOF@SUMEX-AIM.ARPA nonmon seminar
C00188 00075 ∂14-Apr-84 1802 GROSOF@SUMEX-AIM.ARPA NONMONOTONIC REASONING SEMINAR MEETS 4/18 1PM IN REDWOOD: MCCARTHY
C00192 00076 ∂16-Apr-84 0109 reiter%ubc.csnet@csnet-relay.arpa my visit
C00194 00077 ∂16-Apr-84 0900 JMC*
C00195 00078 ∂16-Apr-84 0900 JMC*
C00196 00079 ∂16-Apr-84 1001 DFH
C00198 00080 ∂16-Apr-84 1008 DFH
C00199 00081 ∂16-Apr-84 1012 DFH
C00200 00082 ∂16-Apr-84 1038 DFH
C00201 00083 ∂16-Apr-84 1040 DFH
C00202 00084 ∂16-Apr-84 1051 DFH
C00203 00085 ∂16-Apr-84 1215 PHY
C00205 00086 ∂16-Apr-84 1220 SJG jobs
C00206 00087 ∂16-Apr-84 1652 TAJNAI@SU-SCORE.ARPA Updating faculty research interests
C00208 00088 ∂16-Apr-84 1720 ASHOK@SU-SCORE.ARPA Advanced Reading and Research
C00209 00089 ∂16-Apr-84 1857 ASHOK@SU-SCORE.ARPA Re: meeting
C00210 00090 ∂16-Apr-84 2201 Mailer failed mail returned
C00211 00091 ∂17-Apr-84 0900 JMC*
C00212 00092 ∂17-Apr-84 0900 JMC*
C00213 00093 ∂17-Apr-84 0902 CL.BOYER@UTEXAS-20.ARPA Recent Texas News
C00221 00094 ∂17-Apr-84 1217 RESTIVO@SU-SCORE.ARPA
C00222 00095 ∂17-Apr-84 1503 DFH
C00223 00096 ∂17-Apr-84 1510 MA mtc quals: a possible date
C00224 00097 ∂17-Apr-84 1738 RPG
C00225 00098 ∂18-Apr-84 0844 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, April 20, 1984
C00227 00099 ∂18-Apr-84 1003 DFH
C00228 00100 ∂18-Apr-84 1019 DFH
C00229 00101 ∂18-Apr-84 1259 DFH
C00230 00102 ∂18-Apr-84 1355 PHY
C00231 00103 ∂18-Apr-84 1522 LIBRARY@SU-SCORE.ARPA Need Some Information about: Intelligent Computer Systems Research
C00234 00104 ∂18-Apr-84 2328 HST old photographs
C00235 00105 ∂19-Apr-84 0951 DFH
C00236 00106 ∂19-Apr-84 1410 PHY
C00237 00107 ∂19-Apr-84 1446 PHY
C00238 00108 ∂19-Apr-84 1645 DFH
C00239 00109 ∂19-Apr-84 1950 reiter%ubc.csnet@csnet-relay.arpa message from David Etherington
C00241 00110 ∂19-Apr-84 2101 FEIGENBAUM@SUMEX-AIM.ARPA Re: Need Some Information about: Intelligent Computer Systems Research
C00247 00111 ∂20-Apr-84 0928 LIBRARY@SU-SCORE.ARPA Applied AI Reporter
C00249 00112 ∂20-Apr-84 1000 JMC*
C00251 00113 ∂20-Apr-84 1109 BMOORE@SRI-AI.ARPA Gabbay's talk
C00252 00114 e20-Apr-84 1128 TYSON@SRI-AI.ARPA re: video displays (from SAIL's BBOARD)
C00254 00115 ∂20-Apr-84 1128 AMSLER@SRI-AI.ARPA The real VDT problem...
C00263 00116 ∂20-Apr-84 1143 DFH
C00264 00117 ∂20-Apr-84 1652 SCHREIBER@SU-SCORE.ARPA Meeting next tuesday
C00266 00118 ∂20-Apr-84 1758 WALDINGER@SRI-AI.ARPA steiner
C00267 00119 ∂20-Apr-84 1831 dswise@csnet-relay.csnet 1980 LISP Proceedings
C00271 00120 ∂20-Apr-84 2356 GROSOF@SUMEX-AIM.ARPA draft on circ'n of =
C00283 00121 ∂21-Apr-84 1455 BUCHANAN@SUMEX-AIM.ARPA Re: Need Some Information about: Intelligent Computer Systems Research
C00285 00122 ∂22-Apr-84 0900 JMC*
C00286 00123 ∂22-Apr-84 1018 @MIT-MC:DAM@MIT-OZ Free will and determinism
C00288 00124 ∂23-Apr-84 0015 dswise@csnet-relay.csnet keeping LISP Proceedings in print
C00293 00125 ∂23-Apr-84 1001 JMC*
C00294 00126 ∂23-Apr-84 1143 MDD
C00295 00127 ∂23-Apr-84 1256 RDG ? Relevance Theory ?
C00296 00128 ∂23-Apr-84 1421 SCHREIBER@SU-SCORE.ARPA
C00298 00129 ∂23-Apr-84 1442 perlis%umcp-cs.csnet@csnet-relay.arpa Re: Free will and determinism
C00301 00130 ∂23-Apr-84 2027 MDD
C00302 00131 ∂23-Apr-84 2245 ARK Ray Reiter
C00303 00132 ∂23-Apr-84 2306 ARK Ray Reiter
C00304 00133 ∂24-Apr-84 0021 ARK Ray Reiter visit
C00305 00134 ∂24-Apr-84 0903 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, April 27, 1984
C00307 00135 ∂24-Apr-84 0908 G.GORIN@LOTS-A NYT new service -- flap in progress
C00309 00136 ∂24-Apr-84 0928 AAAI-OFFICE@SUMEX-AIM.ARPA Program Committee Reception & Dinner
C00311 00137 ∂24-Apr-84 0954 stolfi.pa@Xerox.ARPA Re: CRT & Health & $$$
C00319 00138 ∂24-Apr-84 1037 BSCOTT@SU-SCORE.ARPA Use of small hallway
C00320 00139 ∂24-Apr-84 1124 FENG@SU-SCORE.ARPA switch program
C00321 00140 ∂24-Apr-84 1336 GENESERETH@SUMEX-AIM.ARPA schedule
C00324 00141 ∂24-Apr-84 1357 FEIGENBAUM@SUMEX-AIM.ARPA your SIGLUNCH talk
C00325 00142 ∂24-Apr-84 1441 FENG@SU-SCORE.ARPA Re: change of program
C00327 00143 ∂24-Apr-84 1455 GENESERETH@SUMEX-AIM.ARPA
C00329 00144 ∂24-Apr-84 1502 ELYSE@SU-SCORE.ARPA faculty mtg. mins.
C00331 00145 ∂24-Apr-84 1519 ELYSE@SU-SCORE.ARPA
C00332 00146 ∂25-Apr-84 0715 Colmerauer.GIA@MIT-MULTICS.ARPA Re: Bossu-Siegel paper
C00345 00147 ∂25-Apr-84 0759 BARWISE@SU-CSLI.ARPA Re: The situation in logic
C00353 00148 ∂25-Apr-84 1129 CL.BOYER@UTEXAS-20.ARPA Lisp Conference Program
C00369 00149 ∂25-Apr-84 1457 SCHREIBER@SU-SCORE.ARPA
C00389 00150 ∂25-Apr-84 1502 SCHREIBER@SU-SCORE.ARPA Paying the pretesters
C00391 00151 ∂25-Apr-84 1600 DFH
C00400 00152 ∂25-Apr-84 1603 DFH
C00401 00153 ∂25-Apr-84 1604 ME AP and tty exist
C00402 00154 ∂25-Apr-84 1709 TW Space for Vardi
C00421 00155 ∂25-Apr-84 1820 @MIT-MC:rwg@SPA-NIMBUS RWW's terminal and modem
C00422 00156 ∂25-Apr-84 2015 @MIT-MC:rwg@SPA-NIMBUS mc
C00430 00157 ∂26-Apr-84 0107 @MIT-MC:rwg@SPA-NIMBUS nyc macsyma
C00437 00158 ∂26-Apr-84 0134 HST lisp history
C00439 00159 ∂26-Apr-84 0151 ME news summaries
C00442 00160 ∂26-Apr-84 0458 @COLUMBIA-20.ARPA:STAFF.HERSHMAN@NYU20 nyc macsyma
C00445 00161 ∂26-Apr-84 1100 MULLEN@SUMEX-AIM.ARPA siglunch
C00446 00162 ∂26-Apr-84 1130 DFH
C00447 00163 ∂26-Apr-84 1621 DFH
C00448 00164 ∂26-Apr-84 1626 MA qual date
C00449 00165 ∂27-Apr-84 0900 GEORGEFF@SRI-AI.ARPA Planning/Concurrency workshop
C00457 00166 ∂27-Apr-84 1114 DFH
C00458 00167 ∂27-Apr-84 1126 DFH
C00459 00168 ∂27-Apr-84 1143 MULLEN@SUMEX-AIM.ARPA SIGLUNCH for today
C00460 00169 ∂27-Apr-84 1545 JK
C00471 00170 ∂28-Apr-84 1131 BARWISE@SU-CSLI.ARPA Minker
C00472 00171 ∂28-Apr-84 1204 BARWISE@SU-CSLI.ARPA
C00473 00172 ∂28-Apr-84 2041 CLT me
C00474 00173 ∂29-Apr-84 0024 GROSOF@SUMEX-AIM.ARPA comments on your draft paper
C00479 00174 ∂29-Apr-84 0058 GROSOF@SUMEX-AIM.ARPA Re: thanks for comments
C00480 00175 ∂29-Apr-84 0900 JMC*
C00488 00176 ∂30-Apr-84 0801 PHY
C00489 00177 ∂30-Apr-84 1018 EMMA@SU-CSLI.ARPA
C00490 00178 ∂30-Apr-84 1645 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, May 4, 1984
C00492 00179 ∂30-Apr-84 1715 ERIC@SU-CSLI.ARPA
C00493 00180 ∂01-May-84 1013 GEORGEFF@SRI-AI.ARPA Concurrency/planning workshop
C00494 00181 ∂01-May-84 1337 PHY lunch
C00495 00182 ∂01-May-84 1512 LEP Redone proof of unique names
C00498 00183 ∂01-May-84 1605 reiter%ubc.csnet@csnet-relay.arpa unique names reference
C00501 00184 ∂02-May-84 0613 BH LISP history question
C00502 00185 ∂02-May-84 0843 DFH
C00504 00186 ∂02-May-84 1530 GARDNER@SU-SCORE.ARPA Expert systems and common sense
C00505 00187 ∂02-May-84 1533 AAAI-OFFICE@SUMEX-AIM.ARPA workshop proposal
C00509 00188 Claudia, here is a corrected version. I toned down a few expressions.
C00513 00189 ∂02-May-84 1544 ABADI@SU-SCORE.ARPA yet a new date for mtc quals?
C00515 00190 ∂02-May-84 1548 SCHREIBER@SU-SCORE.ARPA Comp Schedule
C00517 00191 ∂02-May-84 1634 CG
C00518 00192 ∂03-May-84 0154 CL.BOYER@UTEXAS-20.ARPA Texas
C00520 00193 ∂03-May-84 0958 DFH
C00521 00194 ∂03-May-84 1127 DFH
C00522 00195 ∂03-May-84 1538 AAAI-OFFICE@SUMEX-AIM.ARPA
C00523 00196 ∂03-May-84 1600 TAJNAI@SU-SCORE.ARPA Prof. Samuel
C00526 00197 ∂03-May-84 1607 LENAT@SU-SCORE.ARPA AI QUAL THIS JUNE
C00528 00198 ∂03-May-84 1644 GROSOF@SUMEX-AIM.ARPA [Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>: Abstracts]
C00534 00199 ∂03-May-84 1728 ME Prancing Pony Bill
C00536 00200 ∂05-May-84 0127 PACK@SU-SCORE.ARPA
C00537 00201 ∂05-May-84 1328 GROSOF@SUMEX-AIM.ARPA meeting
C00538 00202 ∂05-May-84 1520 LEP Meeting
C00539 00203 ∂05-May-84 2028 GROSOF@SU-SCORE.ARPA partial circn
C00543 00204 ∂05-May-84 2047 GROSOF@SUMEX-AIM.ARPA abstracts, default logic, circumscription pls fwd to Etherington
C00551 00205 ∂06-May-84 0232 GROSOF@SU-SCORE.ARPA draft abstract and seminormality
C00552 00206 ∂06-May-84 0558 GROSOF@SU-SCORE.ARPA partial circumscription
C00570 00207 ∂06-May-84 0931 RPG Lisp Conference
C00571 00208 ∂07-May-84 0756 PHY
C00572 00209 ∂07-May-84 1208 LENAT@SU-SCORE.ARPA TI visit
C00573 00210 ∂07-May-84 1300 DIKRAN@SU-CSLI.ARPA permission to reprint
C00575 00211 ∂07-May-84 2108 @MIT-MC:GAVAN@MIT-OZ Circumscription
C00577 00212 ∂08-May-84 0838 perlis@umcp-cs.arpa Re: circumscription, CADE, invitation
C00580 00213 ∂08-May-84 1104 DFH
C00581 00214 ∂08-May-84 1402 jbn@FORD-WDL1.ARPA Boyer-Moore prover
C00585 00215 ∂09-May-84 0857 DFH
C00586 00216 ∂09-May-84 1118 DFH
C00587 00217 ∂09-May-84 1143 DFH
C00588 00218 ∂09-May-84 1546 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, May 11, 1984
C00591 00219 ∂10-May-84 1135 YEARWOOD@SU-SCORE.ARPA Search for Secretary
C00593 00220 ∂11-May-84 1006 GROSOF@SUMEX-AIM.ARPA circumscription mechanization
C00595 00221 ∂11-May-84 1013 SCHREIBER@SU-SCORE.ARPA picking up exams
C00597 00222 ∂12-May-84 0955 GROSOF@SUMEX-AIM.ARPA etherington and CADE
C00599 00223 ∂12-May-84 0956 GROSOF@SUMEX-AIM.ARPA phone number
C00600 00224 ∂12-May-84 1901 RWW sato
C00601 00225 ∂12-May-84 2244 DIKRAN@SU-CSLI.ARPA
C00602 00226 ∂12-May-84 2249 TANAKA@UTAH-20.ARPA Re: Goto
C00603 00227 ∂13-May-84 0000 GHG* Meeting with A&P committee
C00604 00228 ∂13-May-84 1003 JMC*
C00605 00229 ∂13-May-84 2000 JMC*
C00606 00230 ∂13-May-84 2334 HST LISP CONFERENCE
C00608 00231 ∂14-May-84 0817 PHY
C00612 00232 ∂14-May-84 1044 CLT logic and parallel computation seminar
C00613 00233 ∂14-May-84 1213 TW
C00615 00234 ∂14-May-84 1317 GEORGEFF@SRI-AI.ARPA Re: support for concurrent planning workshp
C00617 00235 ∂14-May-84 1332 SCHREIBER@SU-SCORE.ARPA [Richard Anderson <ANDERSON@SU-SCORE.ARPA>: programming projects]
C00620 00236 ∂14-May-84 1904 TANAKA@UTAH-20.ARPA Re: Goto
C00622 00237 ∂15-May-84 0131 HST lisp history
C00623 00238 ∂15-May-84 0900 JMC*
C00624 00239 ∂15-May-84 0900 JMC*
C00625 00240 ∂15-May-84 0900 JMC*
C00626 00241 ∂15-May-84 0900 JMC*
C00627 00242 ∂15-May-84 0900 JMC*
C00628 00243 ∂15-May-84 0917 vardi@Diablo Re:Space for Vardi
C00629 00244 ∂15-May-84 0921 KRANE.YKTVMX%ibm-sj.csnet@csnet-relay.arpa ArpaNet Communications
C00630 00245 ∂15-May-84 0959 SCHREIBER@SU-SCORE.ARPA [Dageforde.pa@XEROX.ARPA: Prefix Predicate Calculus ok on Comp?]
C00633 00246 ∂15-May-84 1457 GOTELLI@SU-SCORE.ARPA NY Times News Service
C00634 00247 ∂15-May-84 1501 RINDFLEISCH@SUMEX-AIM.ARPA Doug Smith Visit
C00636 00248 ∂15-May-84 1520 STEINBERG@RUTGERS.ARPA Proposed seminar for AAAI sponsorship
C00648 00249 ∂15-May-84 1600 JMC*
C00649 00250 ∂15-May-84 1749 SHORTLIFFE@SUMEX-AIM.ARPA Re: Chandrasekharan workshop
C00651 00251 ∂16-May-84 0749 SIMONDS@CMU-CS-C.ARPA
C00653 00252 ∂16-May-84 0852 SIMONDS@CMU-CS-C.ARPA
C00654 00253 ∂16-May-84 0852 PSZ@MIT-MC AAAI support for AIM Workshop
C00657 00254 ∂16-May-84 0922 PAT@SU-CSLI.ARPA Lunch Meetings with Jon Barwise
C00659 00255 ∂16-May-84 1134 ME DD channels 30-37
C00660 00256 ∂16-May-84 1220 GROSOF@SUMEX-AIM.ARPA Re: paper for Etherington
C00661 00257 ∂16-May-84 1325 SCHREIBER@SU-SCORE.ARPA Bing Huangs comp
C00663 00258 ∂16-May-84 1331 YEARWOOD@SU-SCORE.ARPA Secretary Position
C00664 00259 ∂16-May-84 1342 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT
C00665 00260 ∂16-May-84 1412 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, May 18, l984
C00670 00261 ∂16-May-84 1440 JJW Summer
C00671 00262 ∂16-May-84 1640 YEARWOOD@SU-SCORE.ARPA
C00672 00263 ∂16-May-84 1654 JJW Terminal
C00673 00264 ∂16-May-84 1700 AMSLER@SRI-AI.ARPA Re: end of New York Times news service
C00675 00265 ∂16-May-84 2207 MA
C00677 00266 ∂16-May-84 2359 JMC*
C00678 00267 ∂17-May-84 0821 ELYSE@SU-SCORE.ARPA
C00679 00268 ∂17-May-84 0930 WALTON@SU-SCORE.ARPA Your hours
C00681 00269 ∂17-May-84 0931 STAN@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: my computer account at sri-ai]
C00683 00270 ∂17-May-84 0932 PAT@SU-CSLI.ARPA
C00684 00271 ∂17-May-84 1013 WALTON@SU-SCORE.ARPA
C00685 00272 ∂17-May-84 1017 ZAUDERER@SU-SCORE.ARPA typewriter
C00689 00273 ∂17-May-84 1218 TYSON@SRI-AI.ARPA Computer account on SRI-AI
C00690 00274 ∂17-May-84 1438 JMC
C00691 00275 ∂18-May-84 0900 JMC*
C00692 00276 ∂18-May-84 1423 PAT@SU-CSLI.ARPA Lunch Meeting at Faculty Club
C00694 00277 ∂18-May-84 1654 TAJNAI@SU-SCORE.ARPA Re: telephone number
C00695 00278 ∂18-May-84 2229 HST travel to lisp-conference
C00697 00279 ∂19-May-84 0849 GOLUB@SU-SCORE.ARPA
C00698 00280 ∂19-May-84 1110 GOLUB@SU-SCORE.ARPA
C00699 00281 ∂19-May-84 1240 JK the new decision procedure
C00700 00282 ∂19-May-84 1244 JK decision procedure
C00701 00283 ∂19-May-84 1246 JK
C00702 00284 ∂20-May-84 1101 JK
C00703 00285 ∂20-May-84 1820 LEP Planning proof
C00704 00286 ∂20-May-84 1829 JMC
C00705 00287 ∂20-May-84 2106 JK new derive
C00706 00288 ∂20-May-84 2120 JK
C00707 00289 ∂21-May-84 1012 LAMPING@SU-SCORE.ARPA Comp Grading
C00708 00290 ∂21-May-84 1024 JK
C00709 00291 ∂21-May-84 1420 CHANDRASEKARAN@RUTGERS.ARPA AAAI support for the Workshop
C00710 00292 ∂21-May-84 1924 krovetz@nlm-mcs CMI project
C00712 00293 ∂21-May-84 2238 JJW Thesis proposal
C00728 00294 ∂22-May-84 0813 BARWISE@SU-CSLI.ARPA Re: Lunch Meeting at Faculty Club
C00729 00295 ∂22-May-84 1058 ELYSE@SU-SCORE.ARPA Re: mazda repairs
C00730 00296 ∂22-May-84 1059 SCHREIBER@SU-SCORE.ARPA grades
C00732 00297 ∂22-May-84 1144 krovetz@nlm-mcs Re: electronic library project
C00734 00298 ∂22-May-84 1213 SCHREIBER@SU-SCORE.ARPA
C00735 00299 ∂22-May-84 1304 ALMOG@SRI-AI.ARPA a question
C00736 00300 ∂22-May-84 1508 SCHREIBER@SU-SCORE.ARPA
C00738 00301 ∂22-May-84 1728 baskett@decwrl.ARPA IBM 801 talk
C00761 00302 ∂23-May-84 1155 AAAI-OFFICE@SUMEX-AIM.ARPA [Elaine Rich <CS.RICH@UTEXAS-20.ARPA>: Re: special parking priviledges]
C00763 00303 ∂24-May-84 0304 @MIT-MC:RWG@MIT-MC convergep
C00765 00304 ∂24-May-84 0911 ZAUDERER@SU-SCORE.ARPA typewriter
C00766 00305 ∂24-May-84 1030 MULLEN@SUMEX-AIM.ARPA THERE WILL BE NO SIGLUNCH THIS FRIDAY, MAY 25, 1984,
C00767 00306 ∂24-May-84 1329 SAMUEL@SU-SCORE.ARPA re: BBS Confiscation (from SAIL's BBOARD)
C00770 00307 ∂24-May-84 1351 RPG
C00771 00308 ∂24-May-84 1358 RPG appointment
C00772 00309 ∂24-May-84 1906 CHANDRASEKARAN@RUTGERS.ARPA AAAI Grant
C00773 00310 ∂24-May-84 2246 SHORTLIFFE@SUMEX-AIM.ARPA AAAI grant to AIM Workshop
C00774 00311 ∂24-May-84 2352 SAMUEL@SU-SCORE.ARPA [Phil Lapsley <phil%ucbnewton.CC@Ucb-Vax.ARPA>: [BBS Flame] A Legal View]
C00783 00312 ∂25-May-84 0926 TREITEL@SUMEX-AIM.ARPA re: UCLA Students Would Reelect Ronald Reagan (from SAIL's BBOARD)
C00788 00313 ∂25-May-84 1345 CS.PETRIE@UTEXAS-20.ARPA AI Journal Article
C00789 00314 ∂25-May-84 1546 JK define
C00790 00315 ∂26-May-84 1716 JK
C00791 00316 ∂27-May-84 0430 @MIT-MC:RWG@MIT-MC easier convergp
C00793 00317 ∂27-May-84 1812 JK
C00795 00318 ∂27-May-84 1941 ME returned bboard mail
C00798 00319 ∂28-May-84 0900 JMC*
C00799 00320 ∂28-May-84 1522 SCHREIBER@SU-SCORE.ARPA [Arthur Keller <ARK@SU-AI.ARPA>: About Changing the Comprehensive Programming Project ]
C00816 00321 ∂28-May-84 1930 VAL
C00817 00322 ∂28-May-84 2031 MA (finally) quals
C00818 00323 ∂29-May-84 0406 ARK JJW on programming project
C00822 00324 ∂29-May-84 0839 BARWISE@SU-CSLI.ARPA Rob Goldblatt
C00824 00325 ∂29-May-84 1205 PW LISPM login
C00825 00326 ∂29-May-84 1304 PHY lunch Wednesday
C00826 00327 ∂29-May-84 1438 WALTON@SU-SCORE.ARPA louis lerman
C00827 00328 ∂29-May-84 1528 BERG@SU-SCORE.ARPA textbook order
C00829 00329 ∂29-May-84 1545 YEARWOOD@SU-SCORE.ARPA Secretary
C00831 00330 ∂29-May-84 2200 REGES@SU-SCORE.ARPA Purging files
C00833 00331 ∂29-May-84 2219 Brachman@SRI-KL.ARPA AAAI Conference Scheduling
C00835 00332 ∂30-May-84 0238 @MIT-MC:RWG@SPA-NIMBUS K. Knopf
C00836 00333 ∂30-May-84 0802 DLW@SCRC-STONY-BROOK.ARPA GEOMED
C00837 00334 ∂30-May-84 0818 DLW@SCRC-STONY-BROOK.ARPA Review
C00838 00335 ∂30-May-84 1126 LENAT@SU-SCORE.ARPA AI Qual JUNE 6
C00840 00336 ∂30-May-84 1333 DFH
C00841 00337 ∂30-May-84 1334 DFH
C00842 00338 ∂30-May-84 1603 Brachman@SRI-KL.ARPA
C00843 00339 ∂30-May-84 1638 ME video synth
C00844 00340 ∂30-May-84 1842 PYLYSHYN@CMU-CS-C.ARPA Frame problem
C00846 00341 ∂30-May-84 2234 BOSACK@SU-SCORE.ARPA Re: video synthesizer
C00847 00342 ∂31-May-84 0110 HST visit before lisp conference
C00848 00343 ∂31-May-84 0125 @MIT-MC:RWG@MIT-MC easier convergep
C00851 00344 ∂31-May-84 0743 GARDNER@SU-SCORE.ARPA Thesis draft
C00852 00345 ∂31-May-84 0852 AAAI-OFFICE@SUMEX-AIM.ARPA conference room
C00854 00346 ∂31-May-84 0900 JMC*
C00855 00347 ∂31-May-84 1419 DFH
C00856 00348 ∂31-May-84 1420 BUCHANAN@SUMEX-AIM.ARPA NO SIGLUNCH THIS FRIDAY
C00857 00349 ∂31-May-84 1639 DFH
C00858 00350 ∂31-May-84 1958 JJW Terminal
C00859 00351 ∂31-May-84 2054 reid@Glacier new computers
C00862 00352 ∂01-Jun-84 0216 HST visit
C00863 00353 ∂01-Jun-84 1053 ZM MTC Qual (May 31)
C00864 00354 ∂01-Jun-84 1119 HOBBS@SRI-AI.ARPA First Meeting for Commonsense Summer
C00875 00355 ∂01-Jun-84 1354 CLT
C00876 00356 ∂01-Jun-84 1534 ME Prancing Pony Bill
C00878 00357 ∂01-Jun-84 1546 BOSACK@SU-SCORE.ARPA Re: disk charges
C00880 00358 ∂01-Jun-84 1831 JK
C00883 00359 ∂02-Jun-84 0328 LENAT@SU-SCORE.ARPA ai qual
C00884 00360 ∂02-Jun-84 0947 GOLUB@SU-SCORE.ARPA call
C00885 00361 ∂02-Jun-84 1058 LENAT@SU-SCORE.ARPA my tenure case
C00891 00362 ∂02-Jun-84 1140 HOBBS@SRI-AI.ARPA Proposed Overview of Commonsense Summer
C00919 00363 ∂02-Jun-84 1555 JK
C00923 00364 ∂03-Jun-84 1021 JK
C00925 00365 ∂03-Jun-84 1141 JK bug
C00926 00366 ∂03-Jun-84 1520 JK
C00931 00367 ∂04-Jun-84 0440 @MIT-MC:RWG@MIT-MC Well, I can always take refuge in batshit
C00933 00368 ∂04-Jun-84 0500 @COLUMBIA-20.ARPA:STAFF.HERSHMAN@NYU20 nyc macsyma
C00936 00369 ∂04-Jun-84 0910 JK
C00937 00370 ∂04-Jun-84 0930 JMC*
C00938 00371 ∂04-Jun-84 1030 JMC*
C00939 00372 ∂04-Jun-84 1215 Brachman@SRI-KL.ARPA Sticky situation
C00942 00373 ∂04-Jun-84 1553 SCHREIBER@SU-SCORE.ARPA Meeting tomorrow
C00944 00374 ∂04-Jun-84 1617 GEORGEFF@SRI-AI.ARPA Concurrency/Planning workshop
C00947 00375 ∂05-Jun-84 0000 JMC*
C00948 00376 ∂05-Jun-84 0822 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - June 8, 1984
C00950 00377 ∂05-Jun-84 1005 GEORGEFF@SRI-AI.ARPA Concurrency/Planning Workshop
C00953 00378 ∂05-Jun-84 1147 DFH
C00954 00379 ∂05-Jun-84 1149 DFH
C00955 00380 ∂05-Jun-84 1149 DFH
C00956 00381 ∂05-Jun-84 1346 wouk@BRL-VGR.ARPA
C00961 00382 ∂05-Jun-84 1356 KONOLIGE@SRI-AI.ARPA signature
C00962 00383 ∂05-Jun-84 1403 SCHREIBER@SU-SCORE.ARPA
C00963 00384 ∂05-Jun-84 1430 SCHREIBER@SU-SCORE.ARPA
C00964 00385 ∂05-Jun-84 1441 DFH
C00965 00386 ∂05-Jun-84 1443 DFH
C00966 00387 ∂05-Jun-84 1519 DFH
C00969 00388 ∂06-Jun-84 0052 HST some addresses
C00970 00389 ∂06-Jun-84 0136 @MIT-MC:RWG@MIT-MC chudnovskys
C00974 00390 ∂06-Jun-84 0911 HOBBS@SRI-AI.ARPA Meeting Reminder
C00976 00391 ∂06-Jun-84 0945 TAJNAI@SU-SCORE.ARPA Recommendation for Yonnie Malachi
C00977 00392 ∂06-Jun-84 1625 HOBBS@SRI-AI.ARPA Coming meetings
C00979 00393 ∂06-Jun-84 2352 LENAT@SU-SCORE.ARPA AI Qual
C00981 00394 ∂07-Jun-84 0900 JMC*
C00982 00395 ∂07-Jun-84 1341 @USC-ECL.ARPA:FIKES@ECLD Publisher's Prize
C00983 00396 ∂07-Jun-84 1450 DFH
C00984 00397 ∂07-Jun-84 1451 DFH
C00985 00398 ∂07-Jun-84 1549 DFH Re Gosper, Visiting Scholar
C00986 00399 ∂07-Jun-84 1714 GROSOF@SU-SCORE.ARPA knowledge seminar tomorrow.
C00989 00400 ∂07-Jun-84 2110 BOSACK@SU-SCORE.ARPA Re: foonly
C00990 00401 ∂08-Jun-84 0938 DFH
C00991 00402 ∂08-Jun-84 1018 DFH
C00992 00403 ∂08-Jun-84 1111 HOBBS@SRI-AI.ARPA Reminder
C00995 00404 ∂08-Jun-84 1513 minker@umcp-cs.arpa LOGIC and AI
C01012 00405 ∂08-Jun-84 1644 RPG@S1-A.ARPA
C01014 00406 ∂10-Jun-84 0044 LLW@S1-A.ARPA Citizenship Info
C01015 00407 ∂10-Jun-84 0055 LLW@S1-A.ARPA Reactionary Journal
C01025 00408 ∂10-Jun-84 0936 pratt@Navajo
C01027 00409 ∂10-Jun-84 1000 JMC*
C01028 00410 ∂10-Jun-84 1421 MULLER@SU-SCORE.ARPA Scott paper
C01030 00411 ∂11-Jun-84 1033 DFH
C01031 00412 ∂11-Jun-84 1302 CLT
C01032 00413 ∂11-Jun-84 1533 HOBBS@SRI-AI.ARPA Meeting
C01034 00414 ∂11-Jun-84 2248 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa meeting
C01035 00415 ∂12-Jun-84 0359 @MIT-MC:rwg@SPA-NIMBUS [STAFF.HERSHMAN at NYU20: nyc macsyma]
C01038 00416 ∂12-Jun-84 0712 @MIT-MC:KEN@MIT-OZ Re: foolog
C01039 00417 ∂12-Jun-84 0714 BUCHANAN@SUMEX-AIM.ARPA
C01041 00418 ∂12-Jun-84 1756 YOM
C01043 00419 ∂13-Jun-84 0049 HOBBS@SRI-AI.ARPA Meeting Reminder
C01046 00420 ∂13-Jun-84 0227 @MIT-MC:KEN@MIT-OZ foolog
C01047 00421 ∂13-Jun-84 0858 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- June 15, 1984
C01048 00422 ∂13-Jun-84 0953 DLW@SCRC-STONY-BROOK.ARPA Review
C01049 00423 ∂13-Jun-84 1133 DFH
C01050 00424 ∂13-Jun-84 1633 BSCOTT@SU-SCORE.ARPA Secretarial Applicants
C01051 00425 ∂14-Jun-84 1036 DFH
C01052 00426 ∂14-Jun-84 1135 DFH
C01053 00427 ∂14-Jun-84 1503 FY Thought you might be interested.
C01062 00428 ∂15-Jun-84 0940 HOBBS@SRI-AI.ARPA General Meeting
C01063 00429 ∂15-Jun-84 1359 LEP Blocks Axioms
C01065 00430 ∂17-Jun-84 1543 CLT kreisel
C01066 00431 ∂18-Jun-84 0842 BSCOTT@SU-SCORE.ARPA
C01067 00432 ∂18-Jun-84 0846 BUCHANAN@SUMEX-AIM.ARPA LIBRARY KEYS (response to my inquiry)
C01069 00433 ∂18-Jun-84 0900 JMC*
C01070 00434 ∂18-Jun-84 0920 HOBBS@SRI-AI.ARPA Meeting reminder
C01071 00435 ∂18-Jun-84 1019 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -
C01072 00436 ∂18-Jun-84 1033 DFH
C01073 00437 ∂18-Jun-84 1102 DFH
C01074 00438 ∂18-Jun-84 1122 DFH
C01075 00439 ∂18-Jun-84 1613 DFH
C01077 00440 ∂18-Jun-84 2233 YOM Samson Tu
C01078 00441 ∂19-Jun-84 0344 pratt@Navajo
C01080 00442 ∂19-Jun-84 0646 rose@rochester.arpa Very High Performance Computing
C01085 00443 ∂19-Jun-84 0730 @SU-SCORE.ARPA:SJ@MIT-XX.ARPA Prolog Reference
C01087 00444 ∂19-Jun-84 0906 DFH
C01088 00445 ∂19-Jun-84 0925 AAAI-OFFICE@SUMEX-AIM.ARPA On-line abstract/library report
C01126 00446 ∂19-Jun-84 1002 AAAI-OFFICE@SUMEX-AIM.ARPA Execcom meeting
C01128 00447 ∂19-Jun-84 1010 DFH
C01129 00448 ∂19-Jun-84 1027 GOLUB@SU-SCORE.ARPA keys
C01130 00449 ∂19-Jun-84 1317 DFH
C01131 00450 ∂19-Jun-84 1501 DFH
C01132 00451 ∂19-Jun-84 1634 @MIT-MC:rwg@SPA-NIMBUS knopp
C01134 00452 ∂19-Jun-84 1755 BOSACK@SU-SCORE.ARPA DEC computer for the File Server
C01136 00453 ∂19-Jun-84 1936 GOGUEN@SRI-AI.ARPA initiality book draft
C01138 00454 ∂20-Jun-84 0010 YOM Your grade
C01139 00455 ∂20-Jun-84 0021 @MIT-MC:MDC.WAYNE@MIT-OZ Artificial Intelligence Abstracts
C01146 00456 ∂20-Jun-84 0046 ME NYTimes going away soon
C01147 00457 ∂20-Jun-84 0540 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Execcom meeting
C01149 00458 ∂20-Jun-84 1100 DFH
C01150 00459 ∂20-Jun-84 1128 DFH
C01151 00460 ∂20-Jun-84 1300 DFH
C01152 00461 ∂20-Jun-84 1321 DFH
C01153 00462 ∂20-Jun-84 1327 BSCOTT@SU-SCORE.ARPA Len Bosack's message re equipment purchase
C01155 00463 ∂20-Jun-84 1354 DFH
C01157 00464 ∂20-Jun-84 1407 WALKER@SRI-AI.ARPA Re: On-line abstract/library report
C01168 00465 ∂20-Jun-84 1742 BSCOTT@SU-SCORE.ARPA Weening's Office, MJH 353
C01169 00466 ∂21-Jun-84 0316 TARNLUND@SRI-AI.ARPA foolog
C01176 00467 ∂21-Jun-84 0800 JMC*
C01177 00468 ∂21-Jun-84 0800 JMC*
C01178 00469 ∂21-Jun-84 0800 JMC*
C01179 00470 ∂21-Jun-84 0935 BONNETAIN@SU-SCORE.ARPA re: softwar, a new weapon to deal with the Soviets ? (from SAIL's BBOARD)
C01182 00471 ∂21-Jun-84 1306 AAAI-OFFICE@SUMEX-AIM.ARPA additional agenda items
C01184 00472 ∂21-Jun-84 1343 ATP.BLEDSOE@UTEXAS-20.ARPA Re: additional agenda items
C01186 00473 ∂21-Jun-84 1716 BSCOTT@SU-SCORE.ARPA Secretary
C01188 00474 ∂22-Jun-84 0357 @MIT-ML:DLW@SCRC-TENEX Dialnet
C01191 00475 ∂22-Jun-84 0625 AMAREL@RUTGERS.ARPA Re: workshop
C01193 00476 ∂22-Jun-84 0632 @MIT-ML:GARREN%SCC-WAIKATO@MIT-MC Homebrew Computer Club Meets 6/20
C01195 00477 ∂22-Jun-84 0821 BSCOTT@SU-SCORE.ARPA
C01196 00478 ∂22-Jun-84 0844 RWW CLT
C01197 00479 ∂22-Jun-84 1808 AMSLER@SRI-AI.ARPA Comments on `On-line abstract/library report'
C01211 00480 ∂22-Jun-84 2237 CLT if
C01212 00481 ∂25-Jun-84 1456 HOBBS@SRI-AI.ARPA Talk by Pat Hayes and Meeting
C01213 00482 ∂25-Jun-84 1558 RPG ARPA
C01214 00483 ∂25-Jun-84 2027 FEIGENBAUM@SUMEX-AIM.ARPA [Rose Peet <rose@rochester.arpa>: Very High Performance Computing]
C01220 00484 ∂26-Jun-84 1331 OHLANDER@USC-ISI.ARPA FY 85 Incrementals
C01226 00485 ∂26-Jun-84 1337 GROSOF@SU-SCORE.ARPA martin davis
C01227 00486 ∂26-Jun-84 1508 DFH
C01228 00487 ∂27-Jun-84 0906 HOBBS@SRI-AI.ARPA Meeting Reminder
C01230 00488 ∂27-Jun-84 0949 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, June 29, 1984.
C01233 00489 ∂27-Jun-84 1043 SJG nonmonotonic workshop
C01234 00490 ∂27-Jun-84 1419 STAN@SRI-AI.ARPA Student potentially interested in CBCL
C01235 00491 ∂28-Jun-84 0043 Tenenbaum@SRI-KL.ARPA Henry Firdman
C01236 00492 ∂28-Jun-84 1144 reiter%ubc.csnet@csnet-relay.arpa Re: nonmonotonic workshop
C01238 00493 ∂28-Jun-84 1613 perlis@umcp-cs.arpa formula circumscription
C01240 00494 ∂28-Jun-84 1635 DFH
C01242 00495 ∂02-Jul-84 0900 JMC*
C01243 00496 ∂02-Jul-84 1150 RPG Smith/Kahn/Denelcorp
C01244 00497 ∂02-Jul-84 1154 BSCOTT@SU-SCORE.ARPA Secretary
C01246 00498 ∂02-Jul-84 1420 CWR
C01247 00499 ∂02-Jul-84 1429 BSCOTT@SU-SCORE.ARPA
C01248 00500 ∂02-Jul-84 1433 BOSACK@SU-SCORE.ARPA
C01249 00501 ∂02-Jul-84 1508 ALPERT@SU-SCORE.ARPA model
C01252 00502 ∂02-Jul-84 1620 BOSACK@SU-SCORE.ARPA Unix system programming service
C01255 ENDMK
C⊗;
∂01-Apr-84 1409 DEK NEWS UPDATE FROM CHAIRPERSON SEARCH COMMITTEE!
To: "@FACULT.DIS[1,DEK]"@SU-AI.ARPA
Thanks to all for participating so well in the visit by Tsichritzis.
Next week Nils Nilsson will be visiting us on Monday and Tuesday;
he will speak at the colloquium Tuesday on "Probabilistic Logic".
He will of course be having lunch with us on Tuesday noon, but I imagine
many of you would like to have some time for one-on-one discussions.
Please phone Phyllis (7-4377) to make an appointment to speak with him.
The Monday lunch slot is also open.
Jill and I will host a party at our house on Monday evening, the 9th.
Come for good food and good company, starting at 6pm! Please RSVP
to Phyllis before Friday afternoon, as I must tell the caterers
how much food to buy and prepare.
Round three will take place the following week when Ken Kennedy visits
on Tuesday and Wednesday the 17th and 18th. I hope the fact that
the 17th is the beginning of Passover will not be a serious problem;
there will be another dinner party at my house that evening. This
particular schedule was the only way to fit in with a lot of other
constraints.
Thanks again for your help in this search, which will have such
important consequences for our department in the years ahead.
∂01-Apr-84 1839 reiter%ubc.csnet@csnet-relay.arpa workshop
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 1 Apr 84 18:39:45 PST
Received: by csnet-relay via ubcpob; 1 Apr 84 21:13 EST
Date: Sun, 1 Apr 84 15:09:03 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8404012309.AA24569@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA24569; Sun, 1 Apr 84 15:09:03 pst
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: workshop
The due date for papers was extended to May 1 to avoid conflict with the AAAI
due date. So there is no hurry.
We seem to have nailed down the impossibility of getting equality right by
circumscription for a wide class of 1st order theories, as follows:
Suppose T's axioms are all universally quantified. Then no ground inequalities
can be proved by circumscribing a single predicate of T, or by jointly
circumscribing any number of predicates of T.
An interesting corollary of the proof is that by circumscribing P, no new
ground instance of a different predicate Q can be obtained. This means that
the only hope one has of proving a ground instance of Q is by circumscribing Q.
reiter@rutgers-20
alleged corollary and also generic models
There has to be something wrong or a misunderstanding. I have just finished
an EKL proof, which I shall send you, that starts from the axioms I
presented in New York and proves that the only objects that fly are
birds that aren't ostriches. If we add the one more axiom, not included
in my proof that Tweety is a bird and not an ostrich, then we will
conclude that Tweety flies, which was not deducible before the
circumscription. While I circumscribe the abnormality of aspects,
and that only, and aspects are given by functions, this is not
essential. I could, as Vladimir Lifschitz and others have advocated,
have used a collection of abnormality predicates.
As for equality, I am still puzzling. I have generalized the problem
so that now we are looking for what seems to be the generic models
of a collection of axioms. This has led me to look at forcing and
other exotica. The logicians study generic models in a much more
complicated setting than what is wanted for database theory or
common sense reasoning and certainly don't come up with second
order formulas characterizing the generic models, but I still
have hopes. I am not restricting myself to circumscription.
The idea of generic model is related to the simpler idea of
a generic point of an algebraic variety or the even simpler
idea of a geometric figure in general position, i.e. satisfying
no unnecessary relations.
A related but still apparently different approach involves
trying to characterize an initial model by a suitable second
order formula. It has no maps into it from other models other
than isomorphisms. Therefore, it has as many inequalities as
possible.
Both approaches are still rather vague, and I don't even have
any formulas. Moreover, I'm having considerable difficulty
trying to understand the logical literature that I imagine
to be relevant. I'd ask for help if I knew what I wanted.
I understand that this is the best address for you.
∂02-Apr-84 0736 KJB@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 2 Apr 84 07:36:20 PST
Date: Mon 2 Apr 84 07:37:46-PST
From: Jon Barwise <KJB@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
cc: KJB@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 1 Apr 84 12:22:00-PST
Area F is Foundations, what used to be called D, until A&B were mreged
into NL, for Natural language.
-------
∂02-Apr-84 0811 PHY
To: Cheriton@score
Floyd RWF
Gabriel RPG
McCarthy JMC
Patashnik@score
The Search Committee should meet with Nils Nilsson sometime
Monday, April 9. Don teaches class at 3:15. Please send me
convenient times for an hour meeting BEFORE that time.
Thanks, Phyllis.
∂02-Apr-84 1512 MULLER@SU-SCORE.ARPA EKL / Sail account.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 84 15:12:13 PST
Date: Mon 2 Apr 84 14:58:07-PST
From: Eric Muller <MULLER@SU-SCORE.ARPA>
Subject: EKL / Sail account.
To: jmc@SU-AI.ARPA
It may be that I can spare some time during this quarter to (try to)
finish the SUBLIS/MATCH proof. Is it possible to let my Sail account
(EXM@SAIL) open for this purpose ?
Thanks.
E. Muller.
N.B. : I don't promise to get to the end of the proof; only to try !
-------
Please keep the SAIL account for Eric Muller (EXM) alive for this
quarter. It may be charged to my DARPA account.
∂02-Apr-84 1632 GOTELLI@SU-SCORE.ARPA [John McCarthy <JMC@SU-AI.ARPA>:]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 84 16:32:09 PST
Date: Mon 2 Apr 84 16:25:16-PST
From: Lynn Gotelli <GOTELLI@SU-SCORE.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>:]
To: JMC@SU-AI.ARPA
Would that be budget account number 2-FCZ780?
---------------
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Mon 2 Apr 84 15:42:25-PST
Date: 02 Apr 84 1543 PST
From: John McCarthy <JMC@SU-AI.ARPA>
To: gotelli@SU-SCORE.ARPA
CC: muller@SU-SCORE.ARPA, DFH@SU-AI.ARPA
Please keep the SAIL account for Eric Muller (EXM) alive for this
quarter. It may be charged to my DARPA account.
-------
∂02-Apr-84 1734 ROODE@SRI-NIC.ARPA AAAI Repository
Received: from SRI-NIC.ARPA by SU-AI.ARPA with TCP; 2 Apr 84 17:33:55 PST
Date: Mon 2 Apr 84 17:33:01-PST
From: David Roode <ROODE@SRI-NIC.ARPA>
Subject: AAAI Repository
To: JMC@SU-AI.ARPA
Location: EJ286 Phone: (415) 859-2774
Did you decide to go with a dedicated system? Whatever route you go,
I hope you will provide for some sort of network access rather
than a centralized machine to which a terminal must be connected.
If it were defined carefully, the link could be over a terminal
line, and the remote computer could be a microcomputer system, but at
the same time access could be provided to a remote computer which
was a multi-user system and for which the link had a higher
bandwidth than a terminal line.
-------
We haven't made any decisions, but I agree with your comment.
∂02-Apr-84 2151 Newman.ES@Xerox.ARPA military funding of computer research
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 2 Apr 84 21:51:03 PST
Received: from Mission.ms by ArpaGateway.ms ; 02 APR 84 21:17:17 PST
Date: 2 Apr 84 20:25:17 PST (Monday)
From: Ron Newman <Newman.es@Xerox.ARPA>
Subject: military funding of computer research
To: SU-BBoards@SAIL.ARPA
cc: Newman.es@Xerox.ARPA, MRC@Score.ARPA, JMC@Sail.ARPA,
vardi@diablo.ARPA, treitel@sumex.ARPA, siegman@su-sierra.ARPA,
johnmark@whitney.ARPA, hull@Score.ARPA, JLarson.pa@Xerox.ARPA,
walker@sumex-aim.ARPA, pb@Sail.ARPA, jbn@ford-wdl1.ARPA,
Reed@Su-Sierra.ARPA, cheriton@navajo.ARPA
cc: tw@sail.ARPA, winograd.pa@Xerox.ARPA
The arguments expressed here seem to sum to the following:
1) The military is going to spend the money anyway, and it's better
that they spend it on "good" computer research instead of on "bad"
weapons.
2) DoD-funded computer research isn't really driven by military needs:
the DoD has just found a way to fund basic research behind the backs of
the public and the Congress. DARPA is really just the American version
of Japan's MITI and has little to do with real military applications.
3) It doesn't matter who funds the research; it will find
commercially profitable and socially beneficial uses regardless of who's
funding it.
4) We can't get our money easily any other way. The American people,
the legislature, the NSF, and the corporations are too dumb to recognize
the value of basic research. Only the Pentagon understands.
Professor Terry Winograd has written a very good essay that deals with
these and other arguments for military funding. Excerpting it here
would not do justice to his writing; I invite all of you to read it on
[SU-score]<winograd>military.txt. After you read it, let's resume the
discussion here; there's a lot to chew on in Terry's essay.
/Ron
∂03-Apr-84 0017 reid@su-glacier Re: dictionary or word list
Received: from SU-GLACIER.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 00:17:31 PST
Date: Tuesday, 3 April 1984 00:16:29-PST
To: John McCarthy <JMC@SU-AI.ARPA>
Subject: Re: dictionary or word list
In-Reply-To: Your message of 01 Apr 84 1331 PST.
From: Brian Reid <reid@Glacier>
Sender: Brian Reid <reid@su-glacier>
It's a list of words.
I know that my thesis advisor Bob Sproull has a copy of the tape that
was used to typeset the American Heritage dictionary, but he never even
let me have a copy of it. That's the only true dictionary that I am
aware of in the hands of computer scientists.
∂03-Apr-84 0809 DFH CS258 computer accounts
Should these all be cancelled now except for Muller's, or are
there others which should be kept?
Yes, all but Muller's.
∂03-Apr-84 0900 JMC*
Mike Hyson, 213-354-5138
∂03-Apr-84 0912 MULLER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 09:12:43 PST
Date: Tue 3 Apr 84 09:10:43-PST
From: Eric Muller <MULLER@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 2 Apr 84 15:43:00-PST
Thanks very much.
Eric Muller.
-------
∂03-Apr-84 0927 HULL@SU-SCORE.ARPA Military research spending
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 09:27:07 PST
Date: Tue 3 Apr 84 09:25:06-PST
From: Kent Hull <HULL@SU-SCORE.ARPA>
Subject: Military research spending
To: JMC@SU-AI.ARPA
I apologize for not sending you a copy of a bboard entry in which I made
reference to you and your style of argument. It's a rather long, not
particularly distinguished commentary subtitled 'disagree at length'.
You have always pointed out the obvious with elegance; your one-liner
in this debate was too spare to be incisive. I, for one, would enjoy
reading more detailed critique (even if of my own arguments).
Kent Hull
==========================================================================
-------
The one-liner was because I have spoken my piece on why I think defense
research is important for itself and I only wanted to point out that
this point of view, which ought to be mentioned if only to be refuted,
was being ignored. Because I have said all I want to say for the present,
I feel it is the other side's move on that issue.
While I see nothing actually incorrect about my reply to your message,
I must confess that I read it before reading your BBOARD message.
Many thanks for the encouragement.
∂03-Apr-84 0927 PHY Search Comm.
The best time seems to be Monday April 9 2:00 to 3:00. Okay?
-Phyllis
∂03-Apr-84 1012 BUCHANAN@SUMEX-AIM.ARPA D.Lenat's forms
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 10:12:27 PST
Date: Tue 3 Apr 84 10:12:02-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: D.Lenat's forms
To: jmc@SU-AI.ARPA
John,
Would you like to spend a little while after the faculty mtg today
to give me comments on the draft of the forms? I am most uncertain
about how to make a split vote sound like the CSD is enthusiastic.
bgb
-------
∂03-Apr-84 1326 PHY
To: Cheriton@score
Floyd RWF
Gabriel RPG
McCarthy JMC
Patashnik@score
The Search Committee will meet with Nils Nilsson Monday, April, 9
from 2:00 to 3:00 in room 220 (Chairman's conference room).
-Phyllis
∂03-Apr-84 1706 YOM
that must be a typo. Probably should have only had one Mc.
Well, I don't like to correct you on the references of your own paper,
but since it occurs in reference to the Wise men puzzle, Joe probably
intended to refer to my work on that puzzle. The main work is
unpublished, but there is probably something about it in my
AI memo with the Japanese. Unless you want to mention unpublished
work or track down the other reference, you had probably best
delete the reference.
∂03-Apr-84 1717 SCHREIBER@SU-SCORE.ARPA Welcome Tom Binford!
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 17:17:43 PST
Date: Tue 3 Apr 84 17:10:18-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Welcome Tom Binford!
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Tom Binford has just rejoined the committee!
He was on the last one, and got unjoined because I forgot him.
Welcome back Tom!
Shanee -- One more sandwich, please.
Rob
-------
∂03-Apr-84 1848 YOM
∂03-Apr-84 1724 JMC
Well, I don't like to correct you on the references of your own paper,
but since it occurs in reference to the Wise men puzzle, Joe probably
intended to refer to my work on that puzzle. The main work is
unpublished, but there is probably something about it in my
AI memo with the Japanese. Unless you want to mention unpublished
work or track down the other reference, you had probably best
delete the reference.
---------------------------------------------
---------------------------------------------
I wrote the introduction. We meant to delete that reference. It will be done
in later versions of this paper.
-yom
∂03-Apr-84 1856 GROSOF@SUMEX-AIM.ARPA ANNOUNCING: NONMONOTONIC REASONING SEMINAR; first meeting is 4/11
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 18:56:14 PST
Date: Tue 3 Apr 84 18:55:11-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: ANNOUNCING: NONMONOTONIC REASONING SEMINAR; first meeting is 4/11
To: nonmonotonic-seminar-distribution-list-1: ;
ANNOUNCING: Stanford NONMONOTONIC REASONING SEMINAR for Spring 1984
Organizer: Benjamin Grosof
John McCarthy and I are organizing a nonmonotonic reasoning seminar at
Stanford this spring. The first meeting will be 1:30-3:00pm on Wednesday,
April 11, in Margaret Jacks Hall Room 301. The first half hour will be
devoted to organization of the seminar, i.e. discussion of meeting time,
place, and more importantly, the content of the seminar. Topics to be
covered include current developments in circumscription, default logic,
etc.. Etc. needs to be fleshed out, especially. At 2pm John McCarthy will
speak on "Who's Doing What in Nonmonotonic Reasoning".
Below is the current schedule. Only the first session is definite.
Wednesday afternoons seem a relatively good time; however, the meeting
time slot is flexible. Once a week for an hour seems a reasonable format;
however that too is flexible. Especially we might want to meet for longer,
say an hour and a half, to allow more discussion.
Meeting time and place:
Wednesdays, 2-3 pm Margaret Jacks 301 Stanford University
N.B. The first session will start at 1:30pm for seminar organization
Schedule:
Date Time Topic
---- ---- -----
4/11 1:30-3 seminar organization discussion
John McCarthy "Who's Doing What in Nonmonotonic Reasoning"
4/18 2-3 John McCarthy <something about circumscription>
4/25 2-3 Raymond Reiter
Please respond if you are interested, and indicate what your interests are.
Suggestions (and especially offers) with respect to speakers and topics are
of the highest priority, and are greatly appreciated. Also indicate preference
about meeting time iff you will not be coming at 1:30pm on 4/11; it will be
discussed then.
My address is: grosof@sumex-aim.arpa ; phone is (415)424-8078 (noon-10pm only)
--Benjamin
-------
Ask Carolyn Talcott for her mailing list. Also make sure that VAL (Vladimir
Lifschitz) gets the notices.
∂03-Apr-84 2015 CL.BOYER@UTEXAS-20.ARPA re: ultimate dictionary (from SAIL's BBOARD)
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 20:15:20 PST
Date: Tue 3 Apr 84 22:15:08-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: re: ultimate dictionary (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 31 Mar 84 15:22:00-CST
The ultimate dictionary to be, I hope, is the long term
computer based project of W. P. Lehman at UT's Linguistics
Research Center, which is tracing all the words of all the
Indo-European languages back to their Sanskrit (or other)
roots. But he's still back before the creation of English.
-------
∂03-Apr-84 2235 WIEDERHOLD@SUMEX-AIM.ARPA Re: SAIL accounts
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 22:34:54 PST
Date: Tue 3 Apr 84 22:34:25-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: SAIL accounts
To: JMC@SU-AI.ARPA
cc: faculty@SU-SCORE.ARPA, reges@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 3 Apr 84 22:28:00-PST
I assume it's an either one or the other situation isn't it? And what about
all those idle Vaxen ... ? Gio
-------
I see no reason why it should be "either or".
∂03-Apr-84 2301 WIEDERHOLD@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 84 23:01:32 PST
Date: Tue 3 Apr 84 23:01:16-PST
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 3 Apr 84 22:51:00-PST
I was thinking of total and account management expense. I can easily be
convinced otherwise, since my database biblio is now on NS at SAIL, and
I'd like to it used. Gio
-------
I would be very surprised if account management expense were significant,
since each of the systems have automated their accounting and their
transmission of the bill to SCORE for allocation to accounts. Of course,
some of the machines may have minimum charges per account, but at least
on SAIL, these are trivial.
∂04-Apr-84 1602 EMMA@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Apr 84 16:01:56 PST
Date: Wed 4 Apr 84 15:57:33-PST
From: Emma Pease <EMMA@SU-CSLI.ARPA>
To: finterest@SU-CSLI.ARPA, nlinterest@SU-CSLI.ARPA
The mailing lists have been set up for the Foundation and the Natural
Language areas.
They are named as below:
F1 through F4 > For the specific areas
NL1 through NL9 > " "
Finterest and NLinterest >for the entire area and friends
All mailing lists are at Turing and so for those outside turing please
remember to write Finterest@turing (or Finterest@csli).
The Computer Language area lists are also ready (except for CLinterest
which should be ready by the end of the day).
Please send any problems to csli-requests.
Emma Pease (csli-requests)
-------
∂04-Apr-84 1811 JK ekl
Formulas are now preceded by semicolons when displayed.
∂05-Apr-84 0714 perlis%umcp-cs.csnet@csnet-relay.arpa nonmonotonic reference request
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 5 Apr 84 07:14:27 PST
Received: by csnet-relay via umcppo; 5 Apr 84 9:25 EST
Date: 5 Apr 84 09:16:40 EST (Thu)
From: Don Perlis <perlis%umcp-cs.csnet@csnet-relay.arpa>
Subject: nonmonotonic reference request
To: jmc%su-ai.arpa@csnet-relay.arpa
Cc: phil-sci%mit-oz%mit-mc.arpa@csnet-relay.arpa
BIBLIOGRAPHY ON NON-MONOTONIC LOGIC
I am compiling a bibliography of literature on nonmonotonic logic, to be
made available to the AI community, and in particular to the workshop on
non-monotonic reasoning that will take place in October in New Paltz, New
York.
I would greatly appreciate references from the AI community, both to
published and unpublished material (the latter as long as it is in
relatively completed form and copies are available on request). Material
can be sent to me at perlis@umcp-cs and also by post to D. Perlis, Computer
Science Department, University of Maryland, College Park, MD 20742.
Thanks in advance for your cooperation.
--Don Perlis
∂05-Apr-84 1350 PHY
Time is running out -- do you want an appointment to see Nils Nillson
and will you be attending Don's party Monday at 6 pm? Please respond
NOW...
-Phyllis
∂05-Apr-84 1518 ME DD installation
To: JMC@SU-AI.ARPA
CC: LB@SU-AI.ARPA, pack@SU-SCORE.ARPA
∂28-Mar-84 1803 JMC datadisk
To: ME@SU-AI.ARPA
CC: bosack@SU-SCORE.ARPA, pack@SU-SCORE.ARPA
Leslie Pack, just moving from the masters to the PhD program is joining
my group. Her desk is in 450. Is it feasible to put a Datadisc on it,
and do you have one?
ME - Yes, we will try to do that.
∂06-Apr-84 0808 BUCHANAN@SUMEX-AIM.ARPA NO SIGLUNCH TODAY
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 08:07:53 PST
Date: Fri 6 Apr 84 06:02:14-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: NO SIGLUNCH TODAY
To: siglunch@SUMEX-AIM.ARPA
Sorry for the late notice.
bgb
-------
∂06-Apr-84 1014 SCHREIBER@SU-SCORE.ARPA comp questions--pick up today
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 10:14:15 PST
Date: Fri 6 Apr 84 09:53:01-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: comp questions--pick up today
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
PICK UP YOUR COPY OF THE QUESTIONS FROM PHYLLIS TODAY BEFORE 4:45!!
(If you miss her today, call me at 325-2709 over the weekend, or wait until
Monday)
Proofreaders: Please get your corrections back to Phyllis this morning!
Rob
P.S. In order to have a short, productive meeting Tuesday, read the exam
before coming!
-------
∂06-Apr-84 1026 BSCOTT@SU-SCORE.ARPA Re: secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 10:26:18 PST
Date: Fri 6 Apr 84 10:19:24-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: secretary
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 4 Apr 84 07:30:00-PST
Sorry to be slow in responding, John.
Anyway, we're looking into the second-choice possibility now. Also, a flyer
has been sent to all departments, advertising the position.
We have been able to contact Fran Larson. She is delighted to come in for
awhile until we can find a permanent replacement. She will spend a little
time with Diana on Friday, 4/13, and will be here full time beginning
Monday, 4/16. I'll also let Zohar know about this.
With regard to whether Diana found some aspects of the job unsatisfactory,
I don't think she did--with the job itself. I had a long talk with her,
and there are a couple of reasons why she wants to change jobs. The main
one is that she feels a strong need to have more interaction with people,
but also she is somewhat uncomfortable working in a situation where she
has no background to understand what is going on. This is typical of a
scientific environment, and absolutely nothing can be done about it. I think
that most secretaries would not be disturbed by this. But Diana is.
Finally, I strongly recommend that the financial aspects of the job remain
there. This is what makes it a higher level secretarial position, adds
variety, etc. Some secretaries can't work with figures accurately, but those
who can usually enjoy it. Both Fran and Diana like doing it.
Betty
-------
∂06-Apr-84 1129 REGES@SU-SCORE.ARPA Computer Accounts
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 11:29:43 PST
Date: Fri 6 Apr 84 11:23:43-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Computer Accounts
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
I would like to try to get Gene and Jeff to agree to a policy that says that
Masters students get their choice of a SCORE or SAIL account, but by default
they get a SCORE account. That means we set up a SCORE account for them before
they arrive, but they can switch to a SAIL account. For PhD students, however,
I think the default should be that they get both a SCORE and SAIL account.
Two years ago we had a mess setting up student accounts because everyone was
told they had to make a choice between SCORE and SAIL. The students didn't know
what to choose, and there was complete chaos. Last year I set up the SCORE
accounts for everyone by default. I think for next year I would like to set up
SCORE accounts for everyone by default and set up SAIL accounts for all the PhD
students. That way we would be encouraging the PhD students to explore both
systems. I think SCORE is the better choice for the Masters students since
they are mostly here for a year of course work, and SCORE and LOTS use the
same operating system.
-------
∂06-Apr-84 1515 JAMIE@SU-CSLI.ARPA visitor Veronica Dahl
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 15:15:15 PST
Date: Fri 6 Apr 84 15:12:47-PST
From: Jamie Marks <JAMIE@SU-CSLI.ARPA>
Subject: visitor Veronica Dahl
To: Pereira@SRI-AI.ARPA, JMC@SU-AI.ARPA
cc: betsy@SU-CSLI.ARPA, jamie@SU-CSLI.ARPA
I just discovered that Veronica Dahl will be here April 8 through April 15.
I think I can arrange office space for her while she is here if you haven't
already done so. Let me know if I should do anything.
Jamie
-------
∂06-Apr-84 1531 reiter%ubc.csnet@csnet-relay.arpa Request for paper
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 15:31:37 PST
Received: by csnet-relay via ubcpob; 6 Apr 84 17:44 EST
Date: Thu, 5 Apr 84 15:17:46 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8404052317.AA02564@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA02564; Thu, 5 Apr 84 15:17:46 pst
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: Request for paper
(Message from David Etherington).
In your IJCAI-77 paper "Epistemological ...",
you referenced a paper in preparation, "Minimal
Inference - A new way of jumping to conclusions".
Where was the paper published, and/or could I
trouble you to send me a copy, please?
Thank-you in advance,
David Etherington,
Dept Computer Science
University of B.C.,
Vancouver, B.C., CANADA, V6T 1W5.
reiter%rutgers
for David Etherington
The promised paper with a change of name became my 1980 AI Journal paper.
∂06-Apr-84 1531 reiter%ubc.csnet@csnet-relay.arpa Stanford visit
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 6 Apr 84 15:31:44 PST
Received: by csnet-relay via ubcpob; 6 Apr 84 17:44 EST
Date: Fri, 6 Apr 84 00:53:34 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8404060853.AA01893@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA01893; Fri, 6 Apr 84 00:53:34 pst
To: JMC%su-ai.arpa@csnet-relay.arpa
Subject: Stanford visit
Dear John
April 25 will be fine.
To whom will I be talking?
You once mentioned the possibility of inviting Etherington to address your
seminar. In planning my talk it would help me to know whether you intend to
invite him, for then I can avoid treating overlapping topics, especially our
recent work on equality.
Regards, Ray.
reiter@rutgers
seminar
You will be talking to a seminar on non-monotonic reasoning. They will
have heard about circumscription and heard of the other papers in
the 1980 AI Journal including yours. Some will have read them.
Please transmit an invitation to him. Perhaps it would be convenient
for the two of you to come at the same time, but I want to wait on that
till the first meeting of the seminar to see if the others find it
reasonable to have two seminars in one week. Otherwise, we'll make
it later.
∂08-Apr-84 2316 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 8 April 1984
Previous Balance 0.30
Monthly Interest at 1.5% 0
Current Charges 0.60 (vending machine)
-------
TOTAL AMOUNT DUE 0.90
Please deliver payments to Diana Hall, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂09-Apr-84 0900 JMC*
speedometer
∂09-Apr-84 0900 JMC*
hurd,cocke
∂09-Apr-84 1534 FAGIN.SJRLVM1%ibm-sj.csnet@csnet-relay.arpa Mail to Yorktown
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 9 Apr 84 15:34:11 PST
Received: by csnet-relay via xibm-sj; 9 Apr 84 18:11 EST
Date: 9 Apr 1984 14:10:44-PST (Monday)
From: Ron Fagin <FAGIN%ibm-sj.csnet@csnet-relay.arpa>
To: jmc%su-ai.arpa@csnet-relay.arpa
Subject: Mail to Yorktown
To send from the Arpanet to CAPEK at Yorktown, send to
Capek.yktvmx.ibm-sj@csnet-relay.arpa
Best regards, Ron
"Capek.yktvmx.ibm-sj"@csnet-relay
Is this a correct address?
Originally, I had a message for John Cocke that I was asking
you to relay, since he isn't on csnet yet but supposed you
would be. However, my first attempt failed, so I transmitted
the message by telephone. So all I want to know now is whether
this is a correct network path.
∂09-Apr-84 1744 LEP ekl proof
I've finally finished a circumscription proof of the simple (movement only)
blocks axioms in your paper. Due to a bug in EKL, I had to assume something
I should be able to prove -- and due to problems with variable quantification
had to assume something too strong. May be able to fix it later. The pretty
file is on done.ppr[1,lep]
done.ppr[1,lep]
∂10-Apr-84 0104 JIML@SU-SCORE.ARPA re: Undergraduates, and CS (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 01:03:53 PST
Date: Tue 10 Apr 84 01:01:05-PST
From: Jim Lewinson <Jiml@SU-SCORE.ARPA>
Subject: re: Undergraduates, and CS (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 9 Apr 84 20:24:00-PST
I have a really dumb Question.
What was the original message that you are replying to?
I can't find any message that makes sense on SU-BBoards. The only
message that I can think of was on MIT, so I suspect that that isn't
it.
Jim
-------
It was a mistake I've made before - thinking I was reading bboard
while reading my junk mail file. There was a message sent to
faculty suggesting a discussion of undergraduates who want
a special undergraduate major that amounts to a major in computer
science.
∂10-Apr-84 0420 BRADFORD@SU-SIERRA.ARPA Math Sci. as undergrad C.S.
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 04:20:20 PST
Date: Tue 10 Apr 84 04:17:31-PST
From: Ethan Bradford <BRADFORD@SU-SIERRA.ARPA>
Subject: Math Sci. as undergrad C.S.
To: jmc@SU-AI.ARPA
I was a Math. Sci. major as an undergraduate, and I found it perfectly adequate
preparation for theoritical C.S. work. All the courses in Stat., O.R., Math.,
and general sciences were courses that a theory-side computer scientist should
have. Conversely, I'm sure a hardware-side computer scientist would get great
training in an undergrad E.E. major. Thus, though I was at first somewhat
startled and disapointed that there was no undergraduate C.S. major, I now feel
that the current situation is quite good. You may quote me.
-- Ethan (B.S., Math. Sci. '81; M.S., C.S. '82)
-------
∂10-Apr-84 0711 SCHREIBER@SU-SCORE.ARPA Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 07:11:25 PST
Date: Tue 10 Apr 84 07:08:25-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Meeting at 12:15 today.
Rob
-------
∂10-Apr-84 0823 BUCHANAN@SUMEX-AIM.ARPA Siglunch on Friday
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 08:23:12 PST
Date: Tue 10 Apr 84 08:23:10-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Siglunch on Friday
To: jmc@SU-AI.ARPA
cc: bgb@SUMEX-AIM.ARPA
John,
would you be able to speak at Siglunch this Friday noon. I think
the HPP (and visitors) would benefit from hearing your NY AC. SCI.
talk (or something like it).
We meet from 12:05 to 1:15 in the Chemistry Gazebo. If you will
not be able to do it, please let me know as soon as possible.
Otherwise, I'd appreciate a title and 2-3 sentence abstract soon.
I hope you're able to come.
bgb
-------
I would like to get reactions to that talk, but I'll be in L.A. this
Friday. Name another.
∂10-Apr-84 1648 X.JIML@[36.40.0.209]
Received: from GSB-WHY by SU-AI.ARPA with TCP; 10 Apr 84 16:48:00 PST
Date: Tue 10 Apr 84 16:45:11-PST
From: Jim Lewinson <x.Jiml@[36.40.0.209]>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 10 Apr 84 01:33:00-PST
I can certainly understand that. I've gotten confused what machine
I was working on at times. (Not with Sail, mind you, but among the many
20's on campus!)
Jim
-------
∂10-Apr-84 1703 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 17:03:48 PST
Date: Tue 10 Apr 84 16:57:45-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Research Associate Salaries
To: JMC@SU-AI.ARPA, DEK@SU-AI.ARPA, TOB@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I need to talk with you about your 84-85 salary recommendations for your
research associates. I have the HPP recommendations and will be glad to
show them to you. Please let me know a convenient time.
Betty
-------
∂10-Apr-84 2313 GROSOF@SUMEX-AIM.ARPA nonmonotonic reasoning seminar meets today
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Apr 84 23:13:36 PST
Date: Tue 10 Apr 84 23:12:46-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: nonmonotonic reasoning seminar meets today
To: nonmonotonic-distribution-list: ;
Reminder: The first meeting of the nonmonotonic reasoning seminar will be:
Wednesday, April 11, 1:30-3pm, MJ301
The first half hour will be organizational. At 2pm, John McCarthy will speak
on "Who's Doing What in Nonmonotonic Reasoning". --Benjamin
-------
∂11-Apr-84 0749 PHY
To: Cheriton@navajo
Floyd RWF
Gabriel RPG
Knuth DEK
McCarthy JMC
Patashnik@score
The Search Committee will meet with Ken Kennedy Tuesday, April 17,
from 2:30 to 3:30 in room 220 (Chairman's conference room).
-Phyllis
∂11-Apr-84 0828 DFH nonmonotonic file copies
I assume you took back the papers that you left
for me yesterday afternoon? I had not copied them.
Also, I assume you have the copy of the Bossu paper
and the file?
∂11-Apr-84 0830 BUCHANAN@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Apr 84 08:30:11 PST
Date: Wed 11 Apr 84 08:30:08-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 10 Apr 84 16:35:00-PST
Are you available on Friday, April 27 or May 11 for the siglunch talk?
bgb
-------
On Friday April 27, I can talk with title "Some expert systems need common sense"
∂11-Apr-84 1101 BUCHANAN@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Apr 84 11:00:54 PST
Date: Wed 11 Apr 84 10:59:26-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 11 Apr 84 09:22:00-PST
John,
thanks for agreeing to the 4/27 date. We meet in the Chemistry Gazebo
and start at 1:05.
If you want an abstract included in the advertising, please send
me 2-3 sentences. The title seems pretty descriptive, so it will do
if you don't have time.
bgb
-------
Abstract: Several aspects of common sense knowledge and reasoning ability will
be discussed. We will emphasize the ability
to predict the consequences of contemplated actions
expertise require prediction
∂11-Apr-84 1204 GROSOF@SUMEX-AIM.ARPA Re: name
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Apr 84 12:04:11 PST
Date: Wed 11 Apr 84 12:04:10-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: Re: name
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 10 Apr 84 23:33:00-PST
Hi John,
He already is.
Benjamin
-------
∂11-Apr-84 1442 DFH Facilities Committee Meeting
To: "@FACCOM.[1,DFH]"@SU-AI.ARPA
JMC would like to schedule a facilities committee meeting in the near future.
Please let me know what days/times you could come for the rest of this week
and next week so I can try to determine the best time to schedule it.
Thanks. -- Diana
∂11-Apr-84 1740 DEK PARTY! PARTY! PARTY!
To: "@FACULT.DIS[1,DEK]"@SU-AI.ARPA
Guess what? You and your spouse/friend (and small children, if any)
are invited to a dinner party at my house next week, when the
guest of honor will be Ken Kennedy of Rice University.
To provide some variety from the other two parties, we are having
this one on Tuesday evening instead of Monday. That's Tuesday,
April 17.
Time: 6pm. (His colloquium talk will have ended about 5:15.)
Please RSVP to PHY at SAIL by Friday the 13th at 4pm, so that we
can give a good approximation to the caterers. Jill and I hope
to see you all again!
∂11-Apr-84 2023 TRACY@SU-SCORE.ARPA pretakers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Apr 84 20:22:51 PST
Date: Wed 11 Apr 84 20:19:45-PST
From: Tracy Larrabee <Tracy@SU-SCORE.ARPA>
Subject: pretakers
To: SCHREIBER@SU-SCORE.ARPA
cc: tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA, foulser@SU-SCORE.ARPA,
ma@SU-AI.ARPA, papa@SU-SCORE.ARPA, worley@SU-NAVAJO.ARPA,
bothner@SU-SCORE.ARPA, lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA,
kateveni@SU-SHASTA.ARPA, lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA,
zauderer@SU-SCORE.ARPA, mwalker@SU-SCORE.ARPA, Tracy@SU-SCORE.ARPA
In-Reply-To: Message from "Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>" of Tue 10 Apr 84 07:08:26-PST
We have a serious problem with respect to comprehensive pretakers.
Last time, an AI student took the AI section and did quite poorly. I
was not at the meeting which reviewed the test after the pre-taking,
but Billy Wilson was, and he said people questioned the AI students
ability and intelligence, instead of questioning the test (at least
one person who students want to think well of them - Don Knuth - was
involved in this conversation). Billy reported to several people that
their ability might be called into question over their performance as
pretakers, and now people are very wary of serving as pretakers.
I think that, if accurate, the events of last fall are unfortunate. Can the
committee come up with anonymous pretaking, or some guidelines, or make a
statement saying something useful (I don't know what)?
What do you think, Rob?
-------
∂12-Apr-84 0000 BUCHANAN@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 00:00:16 PST
Date: Wed 11 Apr 84 23:59:55-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 11 Apr 84 15:12:00-PST
Siglunch starts at 12:05 and runs to 1:05, with some questioners
staying later if you are still available. (Sorry if I said
otherwise.)
bgb
-------
∂12-Apr-84 0954 RPG 3600's
The mystery of the missing modem has been solved. It is a single board in
one of the 2 machines upstairs. There was some questions about it when
the shipment was unpacked - one of the people who unpacked it reported it
`missing.' Another problem is that HPP's color monitor was charged to us!
Tom Rindfleisch said he wondered when he was going to get the bill!
This mis-billing is being fixed.
This incident makes me wonder about how with-it Lynn Gotelli is - she,
rudely according to reports, wouldn't allow anyone else to check the
packing list, even though it was pointed out to her that it was obviously
wrong. I suspect she decided that one of the fancy-looking 3600 consoles looked
like a color monitor and charged it to us.
The modem looks like a non-blunder, because it is, and has always been, installed
where it belongs.
The long-cable experiment which has a 3600 console in PW's office isn't working
well, and Symbolics won't let us look at the prints to see what's up. I'm not
sure what to do except to try some influence peddling with Symbolics myself.
-rpg-
I suggest you mention the packing list problems to Lynn Gotelli's boss if you
think they are serious enough to warrant it. As for Symbolics, try your
influence, and if that doesn't work, I'll try mine.
∂12-Apr-84 1015 RPG
∂12-Apr-84 1011 JMC
I suggest you mention the packing list problems to Lynn Gotelli's boss if you
think they are serious enough to warrant it. As for Symbolics, try your
influence, and if that doesn't work, I'll try mine.
I talked to Wieneke and got the word as of last night: the problem seems to
be the cable, because the electronics is working fine. SRI has gotten
200' cables to work, so we're trying to get the same type of cable
they have. Apparently the solution to getting CF to work on it is to talk
to the guy doing the work, not Len.
∂12-Apr-84 1033 RPG E/Lisp conference
The conference that the E/Lisp paper is in is in (!) 2 weeks. Frost can't
go. They also won't have a video projector available, and we had planned a
tape of the interface in action as the main part of the presentation. I'm
not sure it pays for me to go, but I have people I should visit at CMU. If
I decide it's the right thing, can we afford the trip?
-rpg-
∂12-Apr-84 1209 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 12:09:11 PST
Date: Thu 12 Apr 84 12:06:42-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE; Friday, April 13, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: E. A. Feigenbaum
TOPIC: A videotape presentation of Allen Newell
on the State of AI, circa 1982
Newell gave this talk at the conference marking the 10th anniversary
of the founding of Information Science Institute. In this talk he
insightfully surveys the territory: where we've been, what we're like
today, where we're going.
-------
∂12-Apr-84 1231 ASHOK@SU-SCORE.ARPA Advanced Reading and Research
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 12:28:11 PST
Date: Thu 12 Apr 84 12:25:07-PST
From: Ashok Subramanian <ASHOK@SU-SCORE.ARPA>
Subject: Advanced Reading and Research
To: jmc@SU-AI.ARPA
cc: ASHOK@SU-SCORE.ARPA
I am a first-year PhD student with AI as my primary area of interest.
I wonder whether it would be possible for you to supervise a quarter of
"Advanced Reading and Research".
Possible format : I could read a bunch of papers (I'll have to ask you
for suggestions) on topics that you think are the most relevant to AI
today, and we could have some discussions.
It would be very nice if you could spare the time. If, however, you can
not, I would still be grateful for any pointers to the right literature.
--ashok
-------
-------
Please come and see me about Advanced Reading and Research.
∂12-Apr-84 1511 DFH Leslie Pack
We were paying for her SAIL charges. Since she is
now your SRA, we will also be getting charged for
her SCORE and ALTOS charges, unless you don't want
to do this, in which case the accounts would have to
be closed.
Leslie:
We plan to pick up the charges mentioned, but do you need the
Alto account? Also will you still be doing work for Luckham for the
computer use of which he should pay?
∂12-Apr-84 1554 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 15:53:59 PST
Date: Thu 12 Apr 84 15:50:09-PST
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 12 Apr 84 15:48:00-PST
I seldom use my alto account -- the charges are probably nearly
non-existent, but it's nice to have. As far as my Score account goes,
I will be using it largely to finish my comp project, which Luckham
previously agreed to fund. I think Stuart mistakenly asked him to pay
for all of my accounts (thinking I was RA'ing for him this quarter)
and he said no. I will speak with him and see if he is still willing
to pay for my Score account. I am not 'working for him' per se, but I
think that he has an interest in my project.
-------
If the charges for the Alto account are trivial, by all means keep it.
However, my impression is that charges for the Altos are not usage
based but are account based, so we are charged whether you use it
or not. I believe we had one Alto account in the group.
∂12-Apr-84 1626 DFH
To: JMC@SU-AI.ARPA, bosack@SU-SCORE.ARPA, gotelli@SU-SCORE.ARPA,
cheriton@SU-HNV.ARPA
Facilities Committee Meeting
I have scheduled the meeting for 4 pm Thursday, April 19, in room 252 MJH.
From the information I have, this should be a feasible time for everyone
getting this message. Let me know right away if that isn't the case.
Thanks. -- Diana
∂12-Apr-84 2139 reid@Glacier
Received: from SU-GLACIER.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 21:39:15 PST
Date: Thu, 12 Apr 84 21:36:25 pst
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: faculty@SU-SCORE.ARPA
In-Reply-To: Your message of 12 Apr 84 2051 PST.
From: Brian Reid <reid@Glacier>
The problem with making concessions to those we want most is that there
is no reliable ordering on the quality of the incoming students, and it
is conceivable that we would lose a good student whom we don't think we
want the most if we make a concession to someone else and not to him.
I don't care much what the policy is, but I do care that we are
consistent. We have already told one fellowship recipient that he must
apply again next year; if we tell this other person that he need not
apply next year, it is imperative that we get in contact with the first
one and explain to him that there has been a change in policy.
As a minor note, not necessarily relevant, we admitted this year three
students who had applied last year, asked for a deferral, had it
denied, and reapplied anyhow. Two of the three got the same fellowship
(Churchill College, Cambridge) that is causing the question this year.
∂12-Apr-84 2205 FEIGENBAUM@SUMEX-AIM.ARPA Re: SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 22:05:33 PST
Date: Thu 12 Apr 84 22:01:29-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: SIGLUNCH ANNOUNCEMENT - Friday, April 13, 1984
To: MULLEN@SUMEX-AIM.ARPA, siglunch@SUMEX-AIM.ARPA
In-Reply-To: Message from "Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>" of Thu 12 Apr 84 12:07:36-PST
In case there's any confusion:
Feigenbaum is not speaking! Newell is speaking, on videotape.
-------
∂12-Apr-84 2311 vardi@Diablo Talk
Received: from SU-HNV.ARPA by SU-AI.ARPA with TCP; 12 Apr 84 23:10:57 PST
Date: Thu, 12 Apr 84 23:07 PST
From: Moshe Vardi <vardi@Diablo>
Subject: Talk
To: bmoore@sri-ai, jmc@su-ai
Cc: fagin.ibm-sj@udel-relay
I enjoyed your comments today. Thanks.
With regard to the size of the Kripke structure need to model a knowledge
structure, you were both right. Countably many states are enough. In fact,
I don't even need Lowenheim-Skolem Theorem to show that. I can give a direct
construction that use only countably many states. Interestingly, both proof
method fail if you deal with omega+1-structures.
Moshe
∂13-Apr-84 1015 SCHREIBER@SU-SCORE.ARPA Pretesting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Apr 84 10:09:03 PST
Date: Fri 13 Apr 84 08:37:00-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Pretesting
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Phyllis will be ready with the exams sometime Monday.
Tracy and Billy have a point about anonymity for the pretesters. I see
no objection to the subcommittee members keeping their pretester's
identity a secret if they wish. You may promise to do so when you recruit
one.
For this procedure to have value, it seems necessary to choose a good
test taker who is very familiar with the area as the pretester.
Rob
-------
∂13-Apr-84 1502 minker%umcp-cs.csnet@csnet-relay.arpa Math Year at Maryland
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 13 Apr 84 15:02:08 PST
Received: by csnet-relay via umcppo; 13 Apr 84 17:43 EST
Date: 13 Apr 84 17:20:54 EST (Fri)
From: JACK MINKER <minker%umcp-cs.csnet@csnet-relay.arpa>
Subject: Math Year at Maryland
To: Reiter%ubc.csnet%csnet-relay.csnet@csnet-relay.arpa,
JMC%su-ai.arpa@csnet-relay.arpa,
henschen%anl-mcs.arpa@csnet-relay.arpa,
decvax!watmath!mhvanemden%ucb-vax.arpa@csnet-relay.arpa,
kjb%sri-ai.arpa@csnet-relay.arpa
Planning for the Math Year of Logic is proceeding
nicely. Our week will be October 22-26. John Osborne,
Chairman of the Mathematics Department is prepared to send
you an official invitation. You will be offered an
honorarium for your entire visit. From this you will have
to pay for travel, motel, and food. I want to allocate the
funds so that everyone obtains an equitable amount consider-
ing that each of you has different travel needs.
The total funds available to be distributed among you
is $5000. I propose that the funds be "allocated" as fol-
lows:
Food $25/day @5 days = $125
Motel $45/day @5 days = $225
"Honorarium" = $300
Total = $650
Each of you would receive a total of $650 plus the fol-
lowing "Travel" allocation:
Jon Barwise =$800 Travel + $650 = $1450
Maarten van Emden =$250 Travel + $650 = $ 900
Larry Henschen =$300 Travel + $650 = $ 950
John McCarthy =$200 Travel + $650 = $ 850
Ray Reiter =$200 Travel + $650 = $ 850
Remember that you will be given an honorarium of the
amount cited above. You may use other funds if you so
choose to offset any of your expenses and pocket the whole
sum. It is not our business what you do with the
honorarium.
The largest "Travel" allocation is to Barwise who will
be coming from Stanford. McCarthy and Reiter are coming
from the Non- Monotonic Reasoning Conference which will be
on the East Coast the week immediately preceding our week.
I believe that the estimates should be satisfactory for
everyone.
I would like to hear from each of you as soon as possi-
ble concerning the allocation of the funds. If you believe
your travel has been estimated too low or too high, or the
other items have been estimated either too high or too low,
please let me know. Assuming that I receive mail from you
stating that the above allocation is satisfactory, I will
ask John Osborne to send you an official invitation. If
there is a problem I will try to make adjustments within the
dollar constraint that I have.
I am delighted that all of you have agreed to partici-
pate in our week activity. We should have an interesting,
enjoyable and hopefully productive time. Please respond as
soon as you receive this mail so that I know where we stand
with the finances.
Best regards,
Jack
!
∂13-Apr-84 1603 GOGUEN@SRI-AI.ARPA
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 13 Apr 84 16:02:52 PST
Date: Fri 13 Apr 84 16:04:59-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
To: JMC@SU-AI.ARPA
cc: GOGUEN@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 12 Apr 84 18:57:00-PST
John, I will be glad to send you what we have now; but if you can wait a couple
of weeks, I expect to be able to send you a revised and improved version. Let
me know. Hope you are well. Fond regards, Joseph
-------
I'll wait for the revised and improved version.
∂13-Apr-84 1604 SJG my future
(I have read your note, and am more convince than ever that I have ...?)
Dear John:
Could you possibly send me a note containing the names of the people
at Hewlett Packard and Fairchild (and anywhere else, except I remember
Nilsson at SRI) about employment for next year? Also Genesereth
has said he might want to split me with you; should you feel like being
half of a foundation. (I'll be talking to him again on Tuesday.)
All for now -
Matt
They are Ira Goldstein and Bert Raphael at HP and Peter Hart at Fairchild.
∂13-Apr-84 1713 DFH phone messages
1. David Chudnovsky called, will try to call you later
2. George Friedman (Northrup) called, and will try to call
you Monday. He was wondering if you might want an afternoon
time with him Wed. either in place of or addition to dinner--
I wasn't quite clear which.
Fran will be in Monday. I have left notes for both her and Betty.
The phone at RLG is 328-0920, but I don't know what my extension
will be. Fran & Betty also have this.
Goodbye and all the best. --- Diana
∂14-Apr-84 1507 GROSOF@SUMEX-AIM.ARPA nonmon seminar
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Apr 84 15:06:58 PST
Date: Sat 14 Apr 84 15:05:57-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: nonmon seminar
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
I've arranged for a bigger room, on Wednesdays from 1-2:30 (so we'll have time
to run over if it so happens): Redwood G-19. The other choice was 160-161k.
I thought since much of our crowd is CSLI-type, and since the REdwood room is
nicer, that it would be preferable. Also, our turnout may decline, so we may
be able to use 301 in later weeks. Let me know if you differ.
I've updated the mailing list, and I'm ready to send out the announcement for
this week as soon as I get an abstract from you. If you wnat me to go ahead
and not wait for your abstract, just let me know.
Benjamin
-------
grosof%sumex
Circumscription and default logic and abstract
Here are some remarks on their relation. See if you agree.
1. Circumscription handles disjunction and default logic doesn't.
2. Because default logic uses consistency, it is sometimes more powerful
than circumscription, but the user has to find the models required to
prove consistency. Therefore, it is in general highly non-constructive.
3. Circumscription produces a second order formula in an entirely
effective way. However, to make good use of the formula one has to
find out what to substitute for the predicate or function variables.
In general, this is undecidable. However, I believe there will be cases
in which default logic (non-constructively) yields a conclusion that the
corresponding circumscription cannot yield. This is because there may
exist no formulas that constitute suitable substitutions. I don't have
a proof of this.
4. In the simple cases that have been used as examples, there is a
substantial equivalence between the models used to establish consistency
in default logic and the formulas substituted for the predicate variables
in circumscription. However, an ordinary first order theorem prover
or proof checker would have to be supplemented by a metamathematical
component to find the models for default logic, while a second order
theorem prover or proof checker would work directly in circumscription
case. In fact I have made several circumscription proofs using EKL.
You may print copies if you want.
Now here's the abstract.
Abstract: A somewhat generalized form of circumscription applies to a wff
rather than a predicate. There are also some new applications - to
the unique names hypothesis, to is-a hieararchies and to the frame problem.
If time permits, the Bossu and Siegel form of non-monotonic inference will
be described and related to circumscription.
∂14-Apr-84 1802 GROSOF@SUMEX-AIM.ARPA NONMONOTONIC REASONING SEMINAR MEETS 4/18 1PM IN REDWOOD: MCCARTHY
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Apr 84 18:02:07 PST
Date: Sat 14 Apr 84 18:00:15-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: NONMONOTONIC REASONING SEMINAR MEETS 4/18 1PM IN REDWOOD: MCCARTHY
To: su-bboard@SUMEX-AIM.ARPA,
nonmonotonic-distribution-list: ;
The second meeting of the nonmonotonic reasoning seminar will be:
TIME: Wednesday, April 18, 1pm-2pm
PLACE: Redwood Hall, Room G-19
Note that BOTH the time and PLACE have changed. The new room is bigger. If
turnout declines, we will go back to MJH.
TOPIC: John McCarthy will be speaking on circumscription.
N.B. There will be substantial overlap with the series of talks
McCarthy gave at CSLI in February and March on Friday afternoons
in which he also discussed circumscription.
ABSTRACT: A somewhat generalized form of circumscription applies to a wff
rather than a predicate. There are also some new applications - to
the unique names hypothesis, to is-a hierarchies and to the frame problem.
If time permits, the Bossu and Siegel form of non-monotonic inference will
be described and related to circumscription.
----------------------------------------------------------------------------
Also, if you are receiving duplicate mailings, please let me know.
--Benjamin
-------
∂16-Apr-84 0109 reiter%ubc.csnet@csnet-relay.arpa my visit
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 16 Apr 84 01:08:54 PST
Received: From ubc.csnet by csnet-relay; 16 Apr 84 3:09 EST
Date: Sun, 15 Apr 84 21:30:21 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8404160530.AA08006@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA08006; Sun, 15 Apr 84 21:30:21 pst
To: JMC@su-ai.arpa
Subject: my visit
Dear John
The title of my talk is "The Closed World Assumption". It will contain much
of the material of my Brooklyn talk, but will also include recent work on
circumscription and equality that I have been doing with Etherington and
Mercer, and work on negation as failure in PROLOG that I have been doing with
Besnard.
I shall be arriving in Stanford around 9PM on Tue. Apr. 24. What hotel will I
be staying in? Joe Halpern has invited me to speak at IBM on Thurs. Apr 26, so
could you reserve my room for Wed night also?
Best wishes.
∂16-Apr-84 0900 JMC*
Lipp hydronics
∂16-Apr-84 0900 JMC*
teller, cocke
∂16-Apr-84 1001 DFH
Hello John,
A call from the FAculty Club asking if you still want the reservation
made for 12 for lunch on May 9. Let me know and it will call Sue
back at 7-4325.
Fran Larson
Please reply to DFH message file. I don't have an account yet.
I don't recall making any such reservation, and I have nothing
scheduled for that time. They should check whether it might be
Perry McCarty. While you have them on the line, please ask for
a reservation for Raymond Reiter to stay April 24 and 24. If you
can't get that, make a reservation at the Holiday Inn. Also please
make a reservation for two for me today at 12:15.
∂16-Apr-84 1008 DFH
To: JMC, DFH
∂16-Apr-84 1000 Mailer failed mail returned
In processing the following command:
MAIL
BE.MSG[SThe following message was aborted because of a command error,
namely, nonexistent recipient(s):
Hello
------- Begin undelivered message: -------
∂16-Apr-84 1000 DFH
John,
A call from the FAculty Club asking if you still want the reservation
made for 12 for lunch on May 9. Let me know and it will call Sue
back at 7-4325.
Fran Larson
------- End undelivered message -------
∂16-Apr-84 1012 DFH
To: JMC, DFH
Veronica Dahl has arrived and called from the Mermaid Inn. Her
phone is 323-9481, X19. She is interested in knowing the time of
her lecture.
∂16-Apr-84 1038 DFH
To: JMC, DFH
There was nothing available for Reiter at Faculty Club on 24th and 25th.
I have made reservation for him at Holiday Inn. Confirmation # 81AC31F6.
The Holiday Inn is on El Camino Real just South of the entrance to the
Stanford campus. Do you need more directions. It will be guaranteed
for late arrival.
∂16-Apr-84 1040 DFH
Veronica Dahl will be here at 11:30 today.
∂16-Apr-84 1051 DFH
To: JMC, DFH
A Kenneth Rose called from the Army in Indianapolis, referred to you by
AAAI, re contracting some education courses. A short course and a
long course. Would like to speak to you about who and what from Stanford
could be done. I asked him to call back tomorrow, Tuesday, and perhaps
you would have names to give him or perhaps our department would not be
able to assist him. In the meantiime I gave him B. Buchanan's number.
∂16-Apr-84 1215 PHY
Prof. Ken Kennedy
TUESDAY -- APRIL 17
9:00
9:30 Carolyn Tajnai MJH 328 (Computer Forum)
10:00 Betty Scott MJH 208 (Business Administrator)
10:30 Gordon Bower Bldg 1
11:00 "
11:30 Bruce Buchanan MJH 238
12:15 faculty lunch MJH 146
1:30 Keith Lantz MJH 430
2:00 Oren Patashnik MJH 220 (Chairman's conference room)
2:30 search committee "
3:00 " "
3:45 refreshments MJH third floor lounge
4:15 colloquium Terman Auditorium
6:00 Don Knuth's home 1063 Vernier Place, Stanford
WEDNESDAY -- APRIL 18
9:00
9:30
10:00
10:30
11:00
11:30 Bob Floyd MJH 338
12:15 Dick Gabriel, Zohar Manna, Faculty Club meet in room 360
1:30 Dick Gabriel MJH 360
2:00 Stuart Reges MJH 210
2:30 students MJH 301
3:00 students "
3:30
4:30 leave
∂16-Apr-84 1220 SJG jobs
Your phone file seems hopelessly out of date. Fairchild's main number is
now ...-7250; Peter Hart no longer works for them anyway, but works for
Syntelligence (?) instead. Anyone else I should try at Fairchild? How about
Xerox PARC?
Thanks. See you tomorrow.
Matt
∂16-Apr-84 1652 TAJNAI@SU-SCORE.ARPA Updating faculty research interests
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Apr 84 16:50:08 PST
Date: Mon 16 Apr 84 16:47:09-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Updating faculty research interests
To: RWF@SU-AI.ARPA, GENESERETH@SU-SCORE.ARPA, GOLUB@SU-SCORE.ARPA,
OLIGER@SU-NAVAJO.ARPA, CHERITON@SU-SCORE.ARPA, JLH@SU-SHASTA.ARPA,
CRC.EJM@SU-SIERRA.ARPA, vrp@SU-AI.ARPA, FAT@SU-SIERRA.ARPA, TOB@SU-AI.ARPA,
ROD@SU-AI.ARPA, JMC@SU-AI.ARPA
I would appreciate your updating the paragraphs I sent you from the
last annual report. I want to print copies for distribution. It will
be useful for CSD, CSL, and the Forum.
Thanks,
Carolyn
-------
∂16-Apr-84 1720 ASHOK@SU-SCORE.ARPA Advanced Reading and Research
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Apr 84 17:20:15 PST
Date: Mon 16 Apr 84 17:15:47-PST
From: Ashok Subramanian <ASHOK@SU-SCORE.ARPA>
Subject: Advanced Reading and Research
To: jmc@SU-AI.ARPA
When would be a good time for me to come talk to you about this ?
What about right now, or a little later in the evening ?
--ashok
-------
∂16-Apr-84 1857 ASHOK@SU-SCORE.ARPA Re: meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Apr 84 18:56:51 PST
Date: Mon 16 Apr 84 18:46:31-PST
From: Ashok Subramanian <ASHOK@SU-SCORE.ARPA>
Subject: Re: meeting
To: JMC@SU-AI.ARPA
cc: ASHOK@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 16 Apr 84 18:16:00-PST
Two o'clock is fine. Thank you.
--ashok
-------
∂16-Apr-84 2201 Mailer failed mail returned
The following message has expired without successful delivery:
------- Begin undelivered message: -------
∂13-Apr-84 2259 JMC
To: suppes@IMSSS
Carolyn and I are happy to accept your April 29 party invitation.
------- End undelivered message -------
∂17-Apr-84 0900 JMC*
jk about Schwartz, Teller
∂17-Apr-84 0900 JMC*
gosper 494-8081
∂17-Apr-84 0902 CL.BOYER@UTEXAS-20.ARPA Recent Texas News
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 17 Apr 84 09:01:51 PST
Date: Tue 17 Apr 84 11:02:05-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Recent Texas News
To: jmc@SU-AI.ARPA, clt@SU-AI.ARPA
a078 16-Apr-84 17:10
AM-CHAIRS
U. of Texas to Establish 32 New Faculty Positions
c.1984 N.Y. Times News Service
AUSTIN, Texas - The University of Texas at Austin said Monday it
would establish 32 new faculty positions in scientific and
engineering fields, each endowed for $1 million.
The university president, Dr. Peter T. Flawn, said he expected that
the new chairs and the university's recent commitments for research
and scholarships in the microelectronics and computer fields would
make it ''generally appreciated across the country'' as ''the place
to be during the next two decades.''
An anonymous Texan gave $8 million for the endowment plan, which is
being matched by five Texas foundations. An additional $16 million
will come from the Regents Endowed Teachers and Scholars Program,
which is financed by income from the state's $1 billion Permanent
University Fund, derived from oil revenue.
Flawn said he was approached by the anonymous donor ''before
Christmas.'' While declining to answer most questions about the
donor, Flawn said he was a Texan who is married to a graduate of the
university here.
''Our anonymous donor believes that the future of Texas and the
United States depends on building our research and development
capabilities, and he sees strong programs in science and engineering
education as critical,'' he said.
Eight fields of study, chemistry, physics, mathematics, molecular
biology, computer engineering, microelectronics, computer-assisted
design and manufacturing, and materials engineering, will each
receive four chairs.
Recruiting to fill the 32 chairs will be conducted at the
university, throughout the nation and abroad, he said. Filling the
positions could require four to five years, but some appointments may
be announced by the end of this year.
With the newly endowed chairs, the university has approximately 700
endowed faculty positions, of which 112 are chairs. Fifty of those
are endowed at $1 million or more.
Flawn said it was difficult to compare endowed chairs among various
universities because of differing requirements, but he said the
number at his university would be among the largest in the nation.
He also said the university would ''custom-build'' programs for
people who are recruited, allowing them to determine the type of
research that would be conducted in the various fields of study.
''The secret to successful research is people,'' he commented,
adding that the university will ''support them and get out of their
way.''
Flawn said the school's efforts to build on its existing strengths
led to its selection by the donor. ''If the university had not
already invested in first-class programs in these areas of science
and engineering, we would not have received this opportunity,'' he
said.
MCC, a consortium of high technology firms, announced last May it
would place its multimillion-dollar research facility in Austin. The
facility is under construction at the Austin Balcones Research Campus.
The university's commitment to the consortium included establishing
a $15 million endowment for faculty positions in electrical
engineering and computer science; creating 30 new faculty positions
in microelectronics and computer science over three years; and
pledging $750,000 a year for 75 graduate fellowships in
computer-related areas, $1 million a year in research funding, and $5
million in capital and laboratory equipment for microelectronics and
computer research.
The school has also made an increasingly successful effort to
recruit the nation's top high school scholars. This year it ranks
second, behind Harvard University, in the number of National Merit
Scholars in its freshman class.
Flawn said fund-raising efforts for donations to match the anonymous
donor's endowment took two months. Foundations giving or pledging
funds are the Cockrell Foundation, Houston, $3.3 million; the Sid W.
Richardson Foundation, Fort Worth, $2 million; Cullen Trust for
Higher Education, Houston, $1 million; the Robert A. Welch
Foundation, Houston, $1 million; and Foundation of the College of
Engineering, University of Texas, $700,000.
Jon P. Newton, an Austin lawyer and chairman of the university
system's board of regents, called the event ''historic'' and
''unparalleled.''
Flawn said a five-year plan for development of the eight program
areas has been drafted with the advice of Dr. Frank Press, president
of the National Academy of Sciences, and Dr. Tom Everhart, dean of
the College of Engineering of Cornell University.
Approximately 47,000 students are enrolled at the university.
nyt-04-16-84 1959est
-------
∂17-Apr-84 1217 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Apr 84 12:17:44 PST
Date: Tue 17 Apr 84 12:01:13-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: jmc@SU-AI.ARPA
cwr - would you be able to recommend an anthology of sorts for
"logic puzzles". thank you.
-------
∂17-Apr-84 1503 DFH
To: JMC, DFH
Yes, Diana did sent the expense request to III for you trip on April ll.
l
l
∂17-Apr-84 1510 MA mtc quals: a possible date
How does May 18th sound for you?
Martin
∂17-Apr-84 1738 RPG
Here's an example of my not being able to do things I'd like to do
and which are appropriate for me to do (from Andy Freeman):
Marilyn Walker says that you can't be the official supervisor of
293 so I signed up with McCarthy instead. I'll get in touch with
Ullman if you think he would be more appropriate. I'd also like
to get a comp. programming project out of this, but it doesn't
have to be finished this quarter.
Dick:
I think we can fix this one. I think the Department should certify Senior
Research Associates automatically eligible for this.
∂18-Apr-84 0844 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, April 20, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Apr 84 08:44:08 PST
Date: Wed 18 Apr 84 08:40:44-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- Friday, April 20, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, April 20, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER:
TOPIC: AUDIOTAPE
COHABITING THE PLANET WITH COMPUTERS
An address presented upon the presentation to him of an honorary
degree at Columbia University, October 11, 1983
by
HERBERT A. SIMON
Nobel Laureate
Richard King Mellon Professor
Carnegie-Mellon University
-------
∂18-Apr-84 1003 DFH
To: JMC, DFH
Leslie Pack phoned and asked if you could call her at home, please, at
321 9963.
∂18-Apr-84 1019 DFH
To: JMC, DFH
∂17-Apr-84 1820 JMC
Please make a reservation for two for noon Friday at Faculty Club.
To confirm - reservations made. FL
∂18-Apr-84 1259 DFH
To: JMC, DFH
Please call Linda Stranberg in Dr. Slagle's office at Naval Research Lab,
Washington. 202 767 2684.
∂18-Apr-84 1355 PHY
Cheriton@navajo
Floyd - RWF
Gabriel - RPG
Knuth - DEK
McCarthy - JMC
Patashnik@score
The chairman search committee meeting will take place on
Monday, April 30, 1:30 to 3:00, in MJH 352.
Letters evaluating the three candidates will be trickling in
until that date. Please come by MJH 326 to read them before
the meeting.
-Phyllis
∂18-Apr-84 1522 LIBRARY@SU-SCORE.ARPA Need Some Information about: Intelligent Computer Systems Research
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Apr 84 15:21:54 PST
Date: Wed 18 Apr 84 15:18:40-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Need Some Information about: Intelligent Computer Systems Research
To: mccarthy@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA
Recently I wrote for some sample copies of Applied Artificial Intelligence
Reporter published by the Intelligent Computer systems Research Institute
at the University of Miami. I received two issues of the newsletter type
publication. Do any of you have any information on or interest in this
institute and/or their publication? Joseph Taub of Columbia and Gerald
Lieberman of Stanford are both listed on the advisory board. However
it is headed by a David Hertz who is the directory and connected tothe
School of Business at University of Miami. There seems to be a very close
connection between the Intelligent Computer Systems Research Institute and
Scientific DataLink (Comtex). The newsletter has a lot about Comtex in it
and Phoebe Huang of Comtex is listed as a consulting editor.
Any information you have about this institute would be of interest to me.
Would you be interested in our receiving their publication (a monthly at
$50/year) to keep up with what they are doing?
Harry
-------
My own opinion is that the Library should regard the AI trade press as
contrasted with the AI scientific press as something of lower priority.
I haven't read any of it, but my impression is that it is of lower
interest than the engineering trade press. At least no-one has ever
referred in writing or orally to anything in any of these newsletters.
∂18-Apr-84 2328 HST old photographs
you told that you might have saved some old photographs - are I right?
please try to collect them and tell me what you are willing to show me.
∂19-Apr-84 0951 DFH
To: JMC, DFH
A Professor Bernard Lorimy called from Paris to ask you to give the
introductory lecture in your general view of the Concepts of AI for a
Congress to be held at Avignon (go, go - take Caroline!) in October of
this year.
He went on at great length giving names I could not take and indicating
that this was a very high level group, mentioning Club of Rom, Schlumberger
people, Tokyo U., Schwartz, Feigenbaum, and said something about its
being sponsred by the Meriuex Fdn.
His address is 17 Avenue George V, Paris. Home phone:763 1992. Office
phone 723 6185. Telex #640233.
∂19-Apr-84 1410 PHY
McCarthy - jmc
Would you be available for lunch at the Faculty Club
Monday, May 14,
with Don Knuth?
-Phyllis
That will be fine. Any specific subject?
∂19-Apr-84 1446 PHY
∂19-Apr-84 1423 JMC
That will be fine. Any specific subject?
-
Thanks, May 14, 12:15, Faculty Club.
No just a friendly visit.
∂19-Apr-84 1645 DFH
To: JMC, DFH
John Coxe stopped by the office. Said your contract should be all set and
you should have gotten it. If you have not, you should call his secretary,
Marcia, at (914) 945 2150.
∂19-Apr-84 1950 reiter%ubc.csnet@csnet-relay.arpa message from David Etherington
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 19 Apr 84 19:50:28 PST
Received: From ubc.csnet by csnet-relay; 19 Apr 84 21:33 EST
Received: from ubc-vision.UUCP (ubc-vision.ARPA) by ubc-ean.UUCP (4.12/3.14)
id AA09158; Thu, 19 Apr 84 16:00:19 pst
Date: Thu, 19 Apr 84 16:00:17 pst
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8404200000.AA18209@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA18209; Thu, 19 Apr 84 16:00:17 pst
To: JMC@su-ai.arpa
Subject: message from David Etherington
I forgot about a commitment during May:
May 17 P.M. to May 21 A.M., I have
in-laws visiting. If no other time
is suitable, I can come then, but
I'd like to be here for as much
of that time as possible. I hope
that this doesn't create problems.
Thanx,
David Etherington.
∂19-Apr-84 2101 FEIGENBAUM@SUMEX-AIM.ARPA Re: Need Some Information about: Intelligent Computer Systems Research
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Apr 84 21:01:37 PST
Date: Thu 19 Apr 84 21:00:09-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Need Some Information about: Intelligent Computer Systems Research
To: LIBRARY@SU-SCORE.ARPA, mccarthy@SU-AI.ARPA, buchanan@SUMEX-AIM.ARPA
In-Reply-To: Message from "C.S./Math Library <LIBRARY@SU-SCORE.ARPA>" of Wed 18 Apr 84 15:21:35-PST
Harry, I think that newsletter is a loser...Ed
-------
∂20-Apr-84 0928 LIBRARY@SU-SCORE.ARPA Applied AI Reporter
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 09:28:12 PST
Date: Fri 20 Apr 84 09:25:19-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Applied AI Reporter
To: jmc@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA
Thanks for your responses. I did not think the publication looked very
substantial but wanted to check. I'm still a little curious about the
connection with Comtex and exactly the research purpose or goals of the
research institute at the University of Miami.
By the way, there has been a lot of interest in Artificial Intelligence
Report by primary users of the Math/CS Library. This publication has
the potential of being very useful not only for CS-AI people but
interdisciplinary researchers, graduate students, and even undergraduates.
Harry
-------
∂20-Apr-84 1000 JMC*
Sato
∂20-Apr-84 1109 BMOORE@SRI-AI.ARPA Gabbay's talk
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 11:09:03 PST
Date: Fri 20 Apr 84 11:09:03-PST
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: Gabbay's talk
To: jmc@SU-AI.ARPA
When and where is it?
--Bob
-------
Gabbay's talk is at 1pm in Redwood.
e20-Apr-84 1128 TYSON@SRI-AI.ARPA re: video displays (from SAIL's BBOARD)
eeceived: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 11:27:55 PST
Date: Fri 20 Apr 84 11:27:37-PST
From: Mabry Tyson <Tyson@SRI-AI.ARPA>
Subject: re: video displays (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 19 Apr 84 23:31:00-PST
I generally agree with many of the views that you post (and am very glad you
speak out) but I must make a small nit-picking argument with the money saves
lives argument. I don't think money saves lives, it just prolongs them. For
every birth there is a death. So preventing someone's death this year must
increase the number of deaths in the future years (assuming birth rate stays
the same), unless you extend the savings infinitely far (that's the old "How
do you fit one more guest into a full, infinite hotel"). So, the question is,
how many dollars extend the average person's life one year?
(Note that a Rolls-Royce will certainly do much better in a car crash than
a VW beetle, but then it seems like cocaine may be much more harmful than
pot (I approve of neither, by the way.).)
-------
∂20-Apr-84 1128 AMSLER@SRI-AI.ARPA The real VDT problem...
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 11:28:41 PST
Date: Fri 20 Apr 84 11:28:39-PST
From: Robert Amsler <AMSLER@SRI-AI.ARPA>
Subject: The real VDT problem...
To: jmc@SU-AI.ARPA
You might want to post this. Not being affiliated with Stanford I
didn't feel I should put things on your bboards.
a555 17-Apr-84 05:02
BC-BACKPAIN-04-17
See WARMUP sidebar
By Alice A. Ellison
The Baltimore Evening Sun (Independent Press Service)
Denise Austin, a Los Angeles-based exercise specialist, was hired to
find out why the strain on the American workforce is surfacing at
such an alarming rate and what to do about it.
She found that most of the developing physical problems affecting
the back, neck and eyes are caused by lack of exercise rather than by
any machines people use.
And, since the problems are projected to increase with the use of
more automated systems, Austin suggests a set of easy-to-do exercises
incorporated into a daily work routine.
The exercises she developed are designed to keep the operators of
automated office equipment on the job and free of pain and
discomfort. There are 20 movements, each with a name such as: ''Arm
Circles,'' ''Pectoral Stretch,'' ''Neck,'' ''Upper Back Stretch,''
''Side Stretch,'' ''Shoulder Stretch'' and ''Wrist Flex.''
The surfacing physical problems are a major concern of employers,
says Austin, explaining, ''A lot of corporations are beginning to
recognize this and are doing a five-minute exercise break (for
everyone at once) with the employees doing the 20 exercises in the
program.'' (For up to 100 free booklets, write Verbatim, Tone Up At
The Terminals, 323 Soquel Way, Sunnyvale, Calif. 94086. Additional
booklets are 10 cents each. Posters are $1 for postage and handling.
Additional posters are 50 cents. Do not send cash.)
Austin says the whole idea of her program is to help relax the
individual and to promote better productivity: ''It's designed to
promote the ways to eliminate a lot of stress through exercise,'' she
says, claiming that exercise promotes better circulation by taking
fresh blood to the brain so the individual can work a little better.
What will happen if people don't take regular exercise?
They'll have more tension, headaches and back pain. Says Austin:
''You see when you sit down and lean forward to operate a computer,
word processor, a typewriter, or even read or write, you'll put
stress on the lower back; all the blood is going to the legs. What
you need to do is get the blood circulating with leg exercises. This
could be rotating your ankles just to get the blood flowing back to
the heart. Maybe even while you're sitting there pick up your feet,
raise them up and down and rotate the ankles . . . maybe even do a
little bicycle action.
''It's important to the legs, too, that the blood gets circulated,''
she says.
Just because a person sits a lot doesn't mean he or she must let the
muscles go untoned. Austin claims one must be in good physical
condition to endure the stress and strain of operating automated
office equipment. She contends that sitting for long periods of time
can become more and more stressful ''to the point where there will be
more absenteeism as more bad backs develop. Right now, the largest
number of people out of work in this country due to illness are out
because something is wrong with their backs. This has a lot to do
with sitting down for long periods at a time without getting the
blood to circulate.''
The exercise specialist maintains that people could become aware of
little things to do to help maintain good physical condition.
''Instead of a coffee break, just walking around, if nothing else,
would get the blood circulating,'' she says, adding that the stomach
muscles, too, can be toned by contracting then relaxing them while
sitting at the terminal.
''It's just a matter of modifying your thinking and behavior, such
as being aware that just a little thing such as contracting the
buttock muscles can help keep your muscles toned,'' says Austin.
Don't doctors say that much of the back pain experienced comes from
bad stomach muscles?
Austin says 80 percent of the back problems are due to weak
abdominals. She explains: ''Back pain due to poor stomach muscles has
to do with your body structure. I say to people, 'You are your own
architect.' The way you sit will determine your posture. If you're
constantly slouching, you're going to get rounded shoulders. Just
think of re-educating the muscles by re-educating your mind, such as,
'Sit up tall and stomach in!' The more you practice the more natural
your good posture will be.''
To sit properly, the individual must have the proper chair. Austin
tells of a newly developed science called ergonomics, ''which means
the study and science of the workplace. An example of this would be a
study of how important it is to be seated and having your feet flat
on the floor and everything in a straight alignment, that is having
your ankle and your knee aligned instead of having your feet under
the chair and your knee forward, which tends to put pressure on your
back. But, if your ankle and your knee are in a straight line you
know your back is in a good position.''
She tells of a special chair that gives air pressure as you sit down
to determine just how far down the seat should go as compared to the
terminal table, ''It's a real science,'' she says.
END
nyt-04-17-84 0752est
***************
-------
∂20-Apr-84 1143 DFH
To: JMC, DFH
John Moussouris called to say he would meet you at Faculty Club
at noon.
∂20-Apr-84 1652 SCHREIBER@SU-SCORE.ARPA Meeting next tuesday
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 16:51:57 PST
Date: Fri 20 Apr 84 16:41:56-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting next tuesday
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
at 12:15, as usual, for lunch. Please have your pretests graded; one
student is pretesting the whole exam: I will give you his work on your
section on Monday.
Rob
-------
∂20-Apr-84 1758 WALDINGER@SRI-AI.ARPA steiner
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 17:58:21 PST
Date: Fri 20 Apr 84 17:57:29-PST
From: WALDINGER@SRI-AI.ARPA
Subject: steiner
To: jmc@SU-AI.ARPA
steiner said friday may 4th afternoon is ok for him to talk to you.
he will try to call you. i will send you a copy of his resume
-------
∂20-Apr-84 1831 dswise@csnet-relay.csnet 1980 LISP Proceedings
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 18:31:12 PST
Received: From oregon-state.csnet by csnet-relay; 20 Apr 84 21:23 EST
Date: 19 Apr 1984 15:00:10-PST
From: dswise%oregon-state.csnet@csnet-relay.arpa
Full-Name: David S. Wise
Subject: 1980 LISP Proceedings
To: boyer%texas@csnet-relay.arpa
Cc: graham@ucb-vax.arpa,
hp-pcd!hplabs!johnson%oregon-state.csnet@csnet-relay.arpa, jmc@su-ai.arpa,
jwhite@parc-maxc.arpa, maida%ibm-sj.csnet@csnet-relay.arpa,
maida%tjwatson@csnet-relay.arpa
I got your electric mail, and just now your letter.
For other recipients of this note, Bob Boyer passed on to me
the problem that the 1980 LISP Conference Proceedings are out of print.
(which, by the way, were published by John Allen privately---not for profit
but because the whole conference was run from his pocket. No underwriters!)
This is not the first I have heard of this problem. Apparently there is
still some demand. (It was a remarkably good conference.)
I was out of town for most of last 2 weeks, and while at HP Labs I broached
the reprint problem with Mark Scott Johnson, Vice Chair of SIGPLAN.
We both agree, in principle, that reprinting is a good idea, but are not sure
how to proceed. I'll shoulder the issue, but don't expect rapid progress.
Possible problems with ACM regarding copyright; they may not want to touch it.
On the other hand, we feel that SIGPLAN might be able to underwrite
nominal costs if warehousing and unsold copies can be controlled;
I suggested publishing on microfiche in order to minimize the incremental
cost of, say, ten more copies. (One time set-up charge can be controlled.)
It raises a large question: How can old conference conference proceedings
be kept available? Every so often ACM has to flush such unsold (paper) volumes
from its warehouse. Perhaps there is already a republication operation
(micro-film or -fiche) in place.
∂20-Apr-84 2356 GROSOF@SUMEX-AIM.ARPA draft on circ'n of =
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Apr 84 23:52:52 PST
Date: Fri 20 Apr 84 23:51:58-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: draft on circ'n of =
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
I'll brave the risk of your being less interested in future versions of this
by sending you a draft now. This was written for an audience of Etherington.
Benjamin
***DRAFT*** 4/20/84
CIRCUMSCRIBING EQUALITY AND UNIQUE NAMES
Benjamin Grosof
THEOREM:
Circumscription leaves the equality predicate unaffected.
Remark: The key condition which we might consider relaxing is:
the substitution principle for equality, which is expressed as a
(2nd-order) axiom in the theory being circumscribed.
Following [McCarthy '84]:
Let A(P) be a formula of second order logic involving a tuple P of free
predicate symbols. A(P) represents our theory. The Pi are the predicates
which are variable in the course of minimizing, i.e. circumscribing, a
wff E(P,x). Then the circumscription of E(P,x) relative to A(P) is:
A1(P) == A(P) /\ (ALL P1. [A(P1) /\ [ALL x. (E(P1,x) => E(P,x))]
=> [ALL x. E(P,x) => E(P1,x))]]
Note that circumscribing the wff E(P,x) can express a joint circumscription,
as shown by [Lifschitz '84]: to circumscribe E1(P,x) and E2(P,x) jointly,
use:
E(P,x,u) == [E1(P,x) /\ u=0] \/ [E2(P,x) /\ u>0]
where u is a new variable on the natural numbers.
We might consider extending the formalism to treat function and constant
symbols as variable in writing A1(P); however this is irrelevant to the
theorem and its proof.
PROOF:
There are two cases:
(1) Equality IS NOT variable: i.e. the equality predicate symbol does not
appear in P.
Then the minimization treats equality as a parameter and doesn't change it.
(2) Equality IS variable: the equality symbol does appear in P. Note we
ignore the question of whether equality is solely or jointly
circumscribed: it does not matter.
In this case, we show that the equality predicate in the circumscribed theory
is equivalent to the equality predicate in the uncircumscribed theory:
ALL Q,R. [A1(Q) /\ A(R) => [ALL x,y. Qe(x,y) <=> Re(x,y)]
where Qe and Re are the equality predicates in the tuples Q and R.
That is, any equality predicate satisfying a circumscription of the theory, is
equivalent to any equality predicate satisfying the uncircumscribed theory.
ARGUMENT:
We assume A(P) includes the usual axioms for equality, including reflexivity
[ALL x. Pe(x,x)]; and the substitution principle, which is a set of axioms,
or which we may think of as a single second order axiom:
ALL Z,x1,x2,y1,y2. [Pe(x1,x2) /\ Pe(y1,y2) => [Z(x1,y1) <=> Z(x2,y2)]]
where Z is a variable over predicates.
As Reiter has pointed out (e.g. message to McCarthy of 3/11/84), we can show:
(*) A(Q) => [A(R) /\ Qe(a,b) => Re(a,b)]
since A(R) includes reflexivity of Re, and A(Q) includes the substitution
principle for which we can substitute above Qe for Pe and Re for Z.
(Reiter used this to show that circumscribing equality alone doesn't work.)
Rewriting (*) as: A(Q) /\ A(R) => [Qe(a,b) => Re(a,b)],
then using symmetry and the fact that A1(Q) includes A(Q) as a conjunct,
we get our desired result.
DISCUSSION:
The argument depends crucially on the substitution principle, which I
assume is part of the circumscribed theory, and which Reiter used in his proof
that circumscribing equality alone doesn't work.
The way to circumscribe equality, then, and to do unique names via
circumscription, is to redefine equality with restricted substitutivity.
McCarthy and I independently arrived at this conclusion: John as sufficient,
I as necessary. A way to do this is to use names and objects, i.e. denotation.
We do not treat denotation explicitly, but as an implicit distinction among
the intensional semantics of the predicates. We then employ two kinds of
equality, one on names and one on objects (denotations). Both are of course
equivalence relations. Full substitution is allowed for the equivalence on
names, but only restricted substitution is allowed for the equivalence on
objects: substitutivity holds only for predicates which are intensionally
"about" objects. We then circumscribe the equivalence on objects, or leave it
variable more generally. (See [McCarthy '84] for some discussion).
Thus we can speak of circumscribing (in)equality only in its redefined sense.
This is implicit below when discussing circumscribing equality.
For the usual sorts of theories, we don't have any predicates which are about
names, except for equality, which has the sense in which it is about names,
i.e. when we write x=A in the sense of substitution for x of the name A, and
the sense in which it is about objects, i.e. Sam = Father(John). Below,
I will write the latter as EQUALS(Sam, Father(John)).
Thus we might be able to hack around this problem efficiently in practice.
Another shortcut in practice might be to circumscribe equality first,
with restricted substitutivity, then do the rest of the circumscription
with full substitutivity, with equality not variable. This won't always work
in the sense of giving the same result as circumscribing equality jointly,
though.
Of course, we can extend this trick to several meta-levels of name-object
distinction.
If we call the equivalence on objects "extensional" and the equivalence on
names as "intensional" then we can say that we can circumscribe the extensional
equality while restricting its substitutivity. For example,
EQUALS(x,y) <=> [(x=A /\ y=B) \/ (x=B /\ y=A)]
is the result of circumscribing the wff NOT(EQUALS(x,y)) in the theory
{EQUALS(A,B)}, where EQUALS is extensional, and = is intensional. It is
somewhat confusing to use the symbol "=" just for one of the two senses of
equality.
As a practical matter, many implementations of first and second order logic
reserve the symbol = for equality with full substitutivity, e.g. McCarthy's
EKL. Then we would define EQUALS as an equivalence relation with a specified
substitutivity. Often we can define its substitutivity as just "for all
predicates except '='". Procedurally this might not be too hard.
Another example is circumscribing the predicate "bird" in the theory
{EXISTS x. bird(x)}. Using the above method to make (extensional) inequality
be jointly circumscribed as well, we can conclude [EXISTS-UNIQUE x. bird(x)]
in the circumscribed theory. Introduce a Skolem constant and use unique names
to get [bird(S) /\ ALL x. bird(x) <=> EQUALS(x,S)]. Note the uniqueness does
not hold with respect to equivalence of names; that is we may have
M =/= S /\ bird(M) as long as EQUALS(M,S).
I would argue that usually our notion of equality which we desire to affect
by circumscription is about denotations i.e. objects, and that equality about
names is used explicitly only rarely in the theory A(P). (By explicit I mean
not counting the "usual axioms for equality" for = ). The real test is
practice: to try these notions on some applications.
REFERENCES:
McCarthy, John "Applications of Circumscription to Formalizing Common Sense
Knowledge" (1984)
Lifschitz, Vladmir "Reflections on Circumscription" (1984?)
-------
∂21-Apr-84 1455 BUCHANAN@SUMEX-AIM.ARPA Re: Need Some Information about: Intelligent Computer Systems Research
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Apr 84 14:55:17 PST
Date: Sat 21 Apr 84 14:53:21-PST
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: Re: Need Some Information about: Intelligent Computer Systems Research
To: LIBRARY@SU-SCORE.ARPA
cc: mccarthy@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA
In-Reply-To: Message from "C.S./Math Library <LIBRARY@SU-SCORE.ARPA>" of Wed 18 Apr 84 15:21:34-PST
I don't have any information about the newsletter. sorry.
bgb
-------
∂22-Apr-84 0900 JMC*
proposal
∂22-Apr-84 1018 @MIT-MC:DAM@MIT-OZ Free will and determinism
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 22 Apr 84 10:18:50 PST
Date: Sun, 22 Apr 1984 13:19 EST
Message-ID: <DAM.12009541089.BABYL@MIT-OZ>
From: DAM%MIT-OZ@MIT-MC.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: dam%oz@MIT-MC.ARPA, perlis%umcp-cs.csnet@CSNET-RELAY.ARPA
Subject: Free will and determinism
In-reply-to: Msg of 21 Apr 1984 16:43-EST from John McCarthy <JMC at SU-AI.ARPA>
Thanks for the submition to the Logic-in-AI mailing list.
I have been just too busy to implement the list (I am trying to finish
my Ph.D. this summer). However I would like to get the list started
either this summer or next fall (I will be at CSLI next year). It
would be nice to have a series of messages to start things of with;
is it all right if I forward your message to people who are likely
to respond?
David Mc
Yes, it is all right to forward my message. Good luck with the thesis.
∂23-Apr-84 0015 dswise@csnet-relay.csnet keeping LISP Proceedings in print
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 23 Apr 84 00:14:53 PST
Received: From oregon-state.csnet by csnet-relay; 23 Apr 84 3:05 EST
Date: 22 Apr 1984 08:57:50-PST
From: dswise%oregon-state.csnet@csnet-relay.arpa
Full-Name: David S. Wise
Subject: keeping LISP Proceedings in print
To: jmc@su-ai.arpa
Cc: boyer@utexas-20.arpa,
hp-pcd!hplabs!johnson%oregon-state.csnet@csnet-relay.arpa,
jwhite@parc-maxc.arpa
I agree with you (heartily) that proceedings are best available in hard copy.
There is a standing problem, however, with warehousing for books with
no demand. About every two years ACM asks SIGPLAN to allow a "fire sale"
(either a give-away or a redigesting of the papers--- by Kimberly-Clark.)
of old stock that is just gathering dust. I am sure you have a similar
problem with obsolete Technical Reports---or perhaps not since you already use
microfiche.
In the case of 1982 and 1984 Proceedings there is no problem. These are
ACM conferences and already stocked by ACM Headquarters under existing
practice. I do not know whether this includes a reprinting policy.
If there is sufficient demand for an item I suspect that they would go
after the sales.
The 1980 conference is a another matter, because it was not an ACM conference---
thus the authors did not sign copyrights over to ACM.
I should ask John Allen whether he holds copyright releases on all papers;
whether these would be acceptable to ACM is another legal trap. Surely,
republication of proceedings originally published elsewhere must be handled
differently from republication of material that has already cleared
the ACM copyright hurdle.
Mark Scott and I agree, for professional goals, that ACM *should* find a
way to republish such material. When there is a demand (and we may have
to argue this---easier after the success of 1982 and, we trust,
the 1984 conference), ACM and SIGPLAN should risk the investment.
This might lead to a series of proceedings---from *all* fields of
computer science.
I lean toward microfiche because it avoids the warehousing objection, *and*
it allows additional short "press runs" at no setup cost. Once the
material is available in this form, it will remain available for
ten or thirty years! We must suspect that if material is of sufficient interest
to warrant reprinting four years later, then it might remain of interest
ten years later.
But I would still prefer a hard copy, were I ordering for my own library!
∂23-Apr-84 1001 JMC*
circum to Anne Gardner
∂23-Apr-84 1143 MDD
I am thinking of spending some of my Guggenheim money on a micro,
probably (for reasons of conservatism) an IBM-PC. Any idea where
I could get a substantial discount in the Bay Area?
-Martin
∂23-Apr-84 1256 RDG ? Relevance Theory ?
To: JMC@SU-AI.ARPA, GROSOF@SUMEX-AIM.ARPA
CC: genesereth@SUMEX-AIM.ARPA
John, Benjamin,
The speaker last Friday quickly mentioned (something which sounded like)
Relevance Theory. Can you send me a pointer to this idea/work?
Thanks,
Russ
∂23-Apr-84 1421 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Apr 84 14:21:38 PST
Date: Mon 23 Apr 84 14:03:08-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
You may pick up the results of the pretest of your section from me today.
(From the one student who took the whole exam.) If not today, tomorrow
morning.
Rob
-------
∂23-Apr-84 1442 perlis%umcp-cs.csnet@csnet-relay.arpa Re: Free will and determinism
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 23 Apr 84 14:42:08 PST
Received: From umcp-cs.csnet by csnet-relay; 23 Apr 84 17:10 EST
Date: 23 Apr 84 16:56:33 EST (Mon)
From: Don Perlis <perlis%umcp-cs.csnet@csnet-relay.arpa>
Subject: Re: Free will and determinism
To: John McCarthy <JMC%su-ai.arpa@csnet-relay.csnet>,
perlis%umcp-cs.csnet@csnet-relay.csnet,
dam%oz%mit-mc.arpa@csnet-relay.csnet
JMC and DAM:
I am in substantial agreement with what JMC says. I think the issue
of 'what can be done' (i.e., what is 'possible') is an important one
for AI, and I have devoted some thought to this in some of my work.
I am sending each of you a copy of my thesis, which devotes some pages
to the issue of representing possibility. At least three different
interpretations are discussed. I think this bears on the question of
what it means that something "can" be done. Roughly, my view is that
there is no one fixed meaning that is appropriate for all situations,
but that the most interesting one for AI is that of what the robot
does not already know (or *easily* derive) to be false. Thus if it is
already known that the robot's legs will not support a certain effort,
this is not something the robot can do; and if it is not so known, then
it remains a possibility for consideration. The focus then is on delineating
what the robot knows-learns-infers, a matter that varies with time.
I am also sending two papers on related matters.
Best regards,
Don P.
∂23-Apr-84 2027 MDD
Thanks for the advice. I've just seen that you're talking at
Lawler's class on Thursday. Would you like to have dinner with
Virginia and me afterwards? Could Carolyn come too?
-Martin
∂23-Apr-84 2245 ARK Ray Reiter
I heard a rumor he's giving a talk or something. Is that true. If so, I'd
like to meet him, etc., if I can make it. Thanks.
Arthur
His talk will be Wednesday at 1pm in the non-monotonic reasoning
seminar. I believe it will be in Redwood Hall G-19. You can get
te abstract from Ben Grosof.
∂23-Apr-84 2306 ARK Ray Reiter
∂23-Apr-84 2302 JMC
His talk will be Wednesday at 1pm in the non-monotonic reasoning
seminar. I believe it will be in Redwood Hall G-19. You can get
te abstract from Ben Grosof.
ARK - Hmmm. I'm leaving for LA on Tuesday afternoon and will be back
on Friday evening. How long will Ray Reiter be around? (I'm going
to LA for IEEE Conf. on Comp. Data Eng. I have a paper there with
Marianne Winslett on updating databases with incomplete information.)
You'll miss him almost certainly. He's arriving at 9pm tomorrow,
and I don't think he intends to stay till Friday.
∂24-Apr-84 0021 ARK Ray Reiter visit
∂23-Apr-84 2312 JMC
You'll miss him almost certainly. He's arriving at 9pm tomorrow,
and I don't think he intends to stay till Friday.
ARK - Oh well, bad timing. I'll leave something for you to give
to him. I'll return Friday evening---if he'll be here then, I'd
love to see him. In the oft chance that he's going on to LA,
I'll be at the Hotel Bonaventure Tuesday night till Friday morning.
Leave it with Fran Larson.
∂24-Apr-84 0903 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, April 27, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 09:03:34 PST
Date: Tue 24 Apr 84 08:59:46-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- Friday, April 27, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, April 27, 1984
LOCATION: Braun Lecture Hall
Mudd Chemistry Building
TIME: 12:05
SPEAKER: John McCarthy
Computer Science Department
Stanford University
TOPIC:
ABSTRACT:
Several aspects of common sense knowledge and reasoning ability will
be discussed. We will emphasize the ability to predict the
consequences of contemplated actions. Sometimes human expertise
involves such prediction, but many expert systems attempt to fit all
expertise into production rules that recommend an action based on the
situation fitting a pattern. When does this suffice and when is
prediction required for good performance?
-------
∂24-Apr-84 0908 G.GORIN@LOTS-A NYT new service -- flap in progress
Received: from LOTS-A by SU-AI with PUP; 24-Apr-84 09:08 PST
Date: Tue 24 Apr 84 09:07:56-PST
From: Ralph Gorin <G.GORIN@LOTS-A>
Subject: NYT new service -- flap in progress
To: Bosack@Score, me@SAIL, jmc@SAIL
Mr. David Phurm, an attorney with the New York Times, called me
to enquire what uses are made of the news wire. He particularly
mentioned that news summaries seem to be making widespread
appearance (I assume through ARPAnet, though he didn't mention that).
He mentioned SRI as one site where he thought the news summary was
being distributed.
I referred this person to Len for a description of the client
population and to John for the computer science explanation of
why the news data base is an interesting research object.
You might want to reconsider the practice of automatic distribution
of any news materials to sites outside of SU-AI.
Ralph
-------
∂24-Apr-84 0928 AAAI-OFFICE@SUMEX-AIM.ARPA Program Committee Reception & Dinner
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 09:28:05 PST
Date: Tue 24 Apr 84 09:27:10-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Program Committee Reception & Dinner
To: JMC@SU-AI.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Buchanan@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, Nilsson@SRI-AI.ARPA,
Engelmore@SUMEX-AIM.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
The AAAI-84 Program Committee is meeting at the Holiday Inn- Palo Alto
on Saturday and Sunday, April 28-29. You are welcome to join the members
of the Program Committee at a small reception Frday night, April 27, from 7:00
to 9:00 pm in the Cypress Room at the Holiday Inn and at a dinner Saturday night
at the Gatehouse Restaurant beginning 7:00 p.m.
Please RSVP to AAAI-Office@sumex or 328-3123.
Cordially,
Ron Brachman Claudia Mazzetti
Program Chair
-------
∂24-Apr-84 0954 stolfi.pa@Xerox.ARPA Re: CRT & Health & $$$
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 09:54:16 PST
Received: from Semillon.ms by ArpaGateway.ms ; 24 APR 84 09:31:04 PST
Date: 24 Apr 84 09:30:19 PST
From: stolfi.pa@XEROX.ARPA
Subject: Re: CRT & Health & $$$
To: BBoard@SU-SCORE.ARPA, BBOARD@SU-AI.ARPA
Cc: stolfi.pa@XEROX.ARPA, <JMC@SU-AI.ARPA>
STO - Re JMC and FY comments on the tricke-down theory:
People seem to forget that dollars are not wealth, just tokens that
stand for wealth. The latter consists ultimately of raw materials,
energy, human labor, and similar resurces. Therefore, the fact that the
total number of tokens is conserved over time, no matter how they are
distributed, is of no particular significance. What matters is what
happens to the resources they stand for.
When a million dollars are spent in a gold-plated rolls-royce or a
useless missile, the problem is not so much that a million tokens have
changed hands, or that they have been passed to a single contractor, or
that the object bought by them will have a single owner. The problem is
that large quantities of labor and materials (a million dollars worth of
them) have been consumed for an unproductive purpose -- in other words,
have been wasted.
Sure, those million dollars end up in the hands of those who provided
those resurces. But wouldn't it have been better for them if they kept
their materials and their time, trading them among themselves and
consuming them for their own benfit? One cannot even say that the
building of the rolls-royce or missile has "stimulated the economy by
injecting money into the market", for those tokens were already there in
the first place, and had to be collected from that same market -- as
taxes, profits, reduced salaries, saving accounts, bond issues, whatever
-- before being spent.
Such "concentrated spending" is good for the country as a whole only if
the thing in which those resources are spent --- a factory, an
hospital, a supercomputer, an orchestra, a billions of safety belts ---
ultimately brings more benfits to the country than could have obtained
if the same resources were consumed otherwise. In this light, for
example, giving out $1 trillion dollars of federal money as welfare
checks is NOT a waste of resources. Spending $ 1 million to create new
unproductive jobs IS a complete waste.
The mortality-income correlation works mainly because the average income
of a state measures the amount and quality of goods and services
consumed by the average inhabitant of that state {\it according to
his/her own interests and for his/her own benfit}, and because those
goods are rather {\it uniformly} distributed.
Let's suppose you, as omnipotent dictator of Tirania, decide to increase
the total income of State X (currently $ 1 billion) by giving your
friend Mr. Foo a check of $ 1 billion (just to be precise, let's say
that half of it comes from the income tax and half from the sale of
treasury bonds) Mr. Foo in turn decides to use that money to build a
diamond-studded palace with a fifty-acre swimming pool full of caviar.
Being a good demagogue, you easily convince the Tiranian population that
the average citizen of State X will end up about 100% richer, since Mr.
Foo will buy from them all materials and services he needs to build his
palace. Ultimately, each citizen will receive from Mr. Foo twice as much
money as he/she used to earn (actually, more than that, thanks to the
famous "multiplier effect" so dear to the economists). Or so you say.
Your audience is not likely to notice that the citizens of State X
produce only $1 billion worth of materials and services anyway, so this
is all Mr. Foo will be able to buy from them; the rest will have to be
bought outside the state. It is hard to see how their average income (if
we exclude that of Mr. Foo) is going to increase. But that is a minor
point. What is more important, after all things are taken into account
the global effect of your action on the Tiranian economy is to waste $2
billion worth of resources in an essentially useless castle, and move a
lot of tokens around. This latter aspect is very good, of course, to
those who earn their bread by moving tokens around, and by ancient
custom are entitled to every nth token that passes through their hands.
P.S: Hey! Has anyone computed how many lifes have been saved by all the
money spent in the Vietnam war, the Middle East, Iran, Afghanistan,
Honduras, El Salvador, etc, etc, etc. Anyone has the data at hand? (I
can provide the calculator)
∂24-Apr-84 1037 BSCOTT@SU-SCORE.ARPA Use of small hallway
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 10:37:02 PST
Date: Tue 24 Apr 84 10:34:04-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Use of small hallway
To: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA
cc: Golub@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
John and Dick,
I talked with Joe Oliger about the use of the hallway space for your
equipment. Joe's response was that he only makes recommendations to
Gene as Chairman. If Gene o.k.'d the placing of the equipment there,
then of course it's o.k.
Betty
-------
∂24-Apr-84 1124 FENG@SU-SCORE.ARPA switch program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 11:24:49 PST
Date: Tue 24 Apr 84 11:21:49-PST
From: Yu-lin Feng <FENG@SU-SCORE.ARPA>
Subject: switch program
To: jmc@SU-AI.ARPA
I asked for a switch program one week ago. If you decided, please let me know.
I would like to do some things you give me or I myself choose a topic.
If I cannot work under your guidance, could you be so kind of recommending me
to Texas working with Profs. Boyer and Moore for a period?
Thank you very much for kind attention.
--Yulin
-------
∂24-Apr-84 1336 GENESERETH@SUMEX-AIM.ARPA schedule
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 13:36:18 PST
Date: Tue 24 Apr 84 13:35:22-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: schedule
To: jmc@SU-AI.ARPA
John,
Here's a proposed schedule for next week.
| Monday | Tuesday | Wednesday | Thursday | Friday |
+-----------------------------------------------------------------------+
| | Formal Proof| | Default Reas| Proc Hints |
| Intro (JMC) | Unify (MRG) | Dog (JMC) | Simul (MRG) | ML (MRG) |
| | BC and FC | Prevention | | |
+-----------------------------------------------------------------------+
| Pred Calc | | | | Ex Sys (MRG) |
| Syntax (MRG)| Search (MRG)| Demo (MRG) | ab (JMC) | Common (JMC) |
| Semantics | | | | Sense |
+-----------------------------------------------------------------------+
Differences between this schedule and last:
(1) Demo
(2) Formal Proofs, unification, bc and fc compressed to allow time for
demo
(3) JMC on Thursday afternoon rather than morning. You might prefer to
do this the other way around, but I have tentatively promised someone a
visit on Thursday afternoon. Let me know if you think that is unworkable.
(5) JMC on Friday afternoon rather than morning talking about open problems
in AI.
Comments?
mrg
-------
What's missing is the Lisp and Prolog intro. Also Do Prevention and ab
along with common sense can be compressed into two rather than 3.
∂24-Apr-84 1357 FEIGENBAUM@SUMEX-AIM.ARPA your SIGLUNCH talk
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 13:56:58 PST
Date: Tue 24 Apr 84 13:56:07-PST
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: your SIGLUNCH talk
To: jmc@SU-AI.ARPA
John,
Alas, I will have to be in NY (giving a fundraising talk for Stanford) on
Friday so I will miss your talk. I'll try to get someone to tape record it
so that I can at least hear it.
Can't believe it! On three successive weeks: Newell (on videotape),
Simon (on audiotape), and McCarthy (in person).
Ed
-------
∂24-Apr-84 1441 FENG@SU-SCORE.ARPA Re: change of program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 14:40:55 PST
Date: Tue 24 Apr 84 14:36:58-PST
From: Yu-lin Feng <FENG@SU-SCORE.ARPA>
Subject: Re: change of program
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 24 Apr 84 13:09:00-PST
I am very thankful if you could telephone Prof. Boyer and Moore and recommend
me involving a new research topic. During the past year I listened your
courses and lectures and I am interested in the LISP proving very much.
I have read Boyer & Moore's book "A computational logic". I very apreciate
their "Theorem prover". Also, when I was in China, I did much work on
program verification and theorem proving.
If Prof. Boyer and Moore agree with the arrangement, please let me know.
Thank you very much for your kind help.
--Yulin
-------
∂24-Apr-84 1455 GENESERETH@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 14:54:19 PST
Date: Tue 24 Apr 84 14:53:12-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 24 Apr 84 13:50:00-PST
John,
The lisp intro is supposed to be part of your intro, or at least it was
last time around. If you want to spend more time on it, that's okay
with me, especially if we can compress Dogs, ab, and common sense into
2 sessions.
Prolog gets introduced in a backhanded way as part of the
discussion of pred calc. and backwward chaining and depth first search.
I haven't decided on the exact contenbts of the demos just yet, but
they will probabbly be one short bc assignment in prolog tradition and
one short assigment using demons.
mrg
-------
∂24-Apr-84 1502 ELYSE@SU-SCORE.ARPA faculty mtg. mins.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 15:02:11 PST
Date: Tue 24 Apr 84 14:58:34-PST
From: Elyse J. Krupnick <ELYSE@SU-SCORE.ARPA>
Subject: faculty mtg. mins.
To: mccarthy@SU-SCORE.ARPA
John, please tell me what, if anything, you want added or subtracted from
my notes for the mins.:
Re: Dick Gabriel's promo to Senior Research Associate
The promotion is strongly supported by Feigenbaum.
Buchanan moves we support his promo, McCarthy seconds, vote is
unanimously passed.
-------
I have no addition to propose, except that the conventional wording
would be either "the motion was passed unanimously" or "the vote
in favor of the motion was unanimous". "vote is unanimously passed"
is linguistically anomalous.
∂24-Apr-84 1519 ELYSE@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Apr 84 15:19:03 PST
Date: Tue 24 Apr 84 15:12:42-PST
From: Elyse J. Krupnick <ELYSE@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 24 Apr 84 15:06:00-PST
Thanks for the tip and your quick response. You're a help to me.
Elyse
-------
∂25-Apr-84 0715 Colmerauer.GIA@MIT-MULTICS.ARPA Re: Bossu-Siegel paper
Received: from MIT-MULTICS.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 07:14:54 PST
Date: Wed, 25 Apr 84 10:05 EST
From: Colmerauer@MIT-MULTICS.ARPA
Subject: Re: Bossu-Siegel paper
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: Message of 1 Apr 84 13:33 EST from "John McCarthy"
Message-ID: <840425150521.031044@MIT-MULTICS.ARPA>
The paper of Bossu-Siegal has been practically accepted by Hayes for AI
review. ( They have also published an artcle "Nonmonotonic reasonning
and databases " in the book "Advances in Data Bases Theory " editd by
Gallaire, Minker and Nicolas at Plenum Press
Here are 2 referencies of ph Besnard (who is presently working with
Reiter and has done a thesis in France (Rennes)):
"Une procedure de decision en logique non-monotone"
Besnard, P. , these de 3eme cycle, Universite de Rennes I
"A DECIDABLE SUBSET OF DEFAUL LOGIC" Besnard, Quiniou et Quinton
Proceedinds AAAI-83 pp27-30
Genevieve Bossu pps: hoping the message will be readdable....
∂25-Apr-84 0759 BARWISE@SU-CSLI.ARPA Re: The situation in logic
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 07:59:11 PST
Date: Wed 25 Apr 84 07:54:47-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Re: The situation in logic
To: JMC@SU-AI.ARPA
cc: kjb@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 25 Apr 84 01:36:00-PST
John,
I will try to remember to send you the little BBS thing,
though I doubt that it will change your mind. INterestingly, I find
the point of view expressed (or maybe I am reading my own view into
it) in your Katz-Chmosky discussion entirely consistent with the
situation in logic piece -- except for the assumption you make that
the use of language for external communication presupposes a language
for internal representation.
If you are free at 1 (to 3) today, you might come to
Fernando's talk. They (he and Stan R) are trying to come up with a
view of robot design that does not require such an internal
representation language, but rather leaves logic in the hands of the
designer. They are not using situation semantics, but I find the work
very much in the spirit of how I think things should go.
Jon
-------
Unfortunately, I can't come at 1, because Raymond Reiter is speaking at
1 to our non-monotonic reasoning seminar. I did not wish to presuppose
that humans have a mentalese, although I must admit that all my thinking
about a robot's internal representation involved a mentalese for them.
∂25-Apr-84 1129 CL.BOYER@UTEXAS-20.ARPA Lisp Conference Program
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 11:28:58 PST
Date: Wed 25 Apr 84 13:29:44-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Lisp Conference Program
To: jmc@SU-AI.ARPA
Here is the program from the Lisp Conference.
23-Apr-84 17:00:56-CST,9531;000000000005
Return-Path: <@CMU-CS-C.ARPA:STEELE%TARTAN@CMU-CS-C.ARPA>
Received: from CMU-CS-C.ARPA by UTEXAS-20.ARPA with TCP; Mon 23 Apr 84 17:00:35-CST
Received: from TARTAN by CMU-CS-C with TLnet; 23 Apr 84 18:00:21-EST
Received: ID <STEELE%TARTAN@CMU-CS-C.ARPA>; Mon 23 Apr 84 17:57:03-EST
Date: Mon 23 Apr 84 17:56:59-EST
From: STEELE%TARTAN@CMU-CS-C.ARPA
Subject: Final version of conference program
To: cl.schneider@UTEXAS-20.ARPA, cl.boyer@UTEXAS-20.ARPA
Here is the final version of the conference program, (almost) suitable
for printing in a mailing flyer. There are three places in brackets
which you should examine:
(1) The time of the Monday evening session is listed as 8:00, leaving two
and a half hours for dinner. That would make the session end a little
after 10:00 PM. Tbis could be moved up to 7:30 if you think that would
be a better compromise between time for dinner and lateness of finish.
(2) The time of the banquet is listed as 7:30. Fill in the time you
really intend to use. I plan to have an after-dinner talk.
(3) I have invited Raymond Smullyan to be the banquet speaker. He
sounded interested and receptive in the initial telephone contact, but
has not yet officially responded to the invitation, so please don't list
him yet in any re-use of this listing.
In addition to the program listed here, the committee has invited Robin
Milner to publish his "A Proposal for Standard ML" as an "invited paper".
He is unable to come to the conference to speak, but the committee felt
the report was of sufficient interest, both for its own sake and as
background material for some of the other papers, that it would be worth
devoting the space in the proceedings for it. (Milner has not yet had
time to respond to this proposal, but I have hopes that he will accept.)
I tell you this so that you can make a more accurate estimate of the page
count for the proceedings if you need this information. There are 34
regular papers, 3 invited talks, at most 1 invited paper, and a banquet
address. If all were to be published at 10 pages apiece (the nominal
maximum), that would come to 390 pages. My guess is that the total will
actually be somewhere between 320 and 350 pages, depending on how many of
the invited talks and papers are actually published in the proceedings.
I assume that I must send the list of authors and their addresses to ACM
to have the author's kits mailed out. Am I correct in assuming that you
are composing the text of the registration flyer to be mailed out, that
contains the program and the hotel information? Also, are we putting an
advertisement in CACM or anywhere else, and who shall be responsible for
that?
--Guy
!
1984 ACM SYMPOSIUM ON
LISP AND FUNCTIONAL PROGRAMMING
TECHNICAL PROGRAM
MONDAY MORNING, AUGUST 6, 1984
09:00 AM Session 1
Chairman: Daniel P. Friedman (Indiana University)
Welcome and opening remarks
General chairman: Robert S. Boyer (University of Texas at Austin)
Local arrangements chairman: Edward S. Schneider (Burroughs Corporation)
Invited talk: "How to Teach LISP"
Patrick H. Winston (Massachusetts Institute of Technology)
"A Critique of Common Lisp"
Rodney A. Brooks and Richard P. Gabriel (Stanford University)
10:40 AM Coffee break
11:05 AM Session 2
Chairman: Jerome Chailloux (INRIA)
"Implementation of Multilisp: Lisp on a Multiprocessor"
Robert H. Halstead, Jr. (Massachusetts Institute of Technology)
"Engines Build Process Abstractions"
Christopher T. Haynes and Daniel P. Friedman (Indiana University)
"Queue-based Multi-processing Lisp"
Richard P. Gabriel and John McCarthy (Stanford University)
12:20 PM Lunch
! 2
MONDAY AFTERNOON, AUGUST 6, 1984
02:10 PM Session 3
Chairman: John Williams (International Business Machines)
"Listlessness is Better than Laziness"
Philip Wadler (Oxford University)
"Stream Processing"
Allen Goldberg (University of California, Santa Cruz, and Kestrel Institute) and Robert Paige (Rutgers University)
"Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield"
Francoise Bellegarde (Centre de Recherche en Informatique de Nancy)
"Schema Recognition for Program Transformations"
John S. Givler and Richard B. Kieburtz (Oregon Graduate Center)
03:50 PM Coffee break
04:15 PM Session 4
Chairman: Guy L. Steele Jr. (Tartan Laboratories)
"Formes: an Object and Time Oriented System for Music Composition and Synthesis"
Pieere Cointe and Xavier Rodet (Institut de Recherche et Coordination en Acoustique/Musique)
"Arctic: A Functional Language for Real-Time Control"
Roger B. Dannenberg (Carnegie-Mellon University)
"muFP, A Language for VLSI Design"
Mary Sheeran (Oxford University)
05:30 PM Break for dinner
! 3
MONDAY EVENING, AUGUST 6, 1984
08:00 PM[?] Session 5
Chairman: Richard P. Gabriel (Stanford University)
"LE LISP, a Portable and Efficient LISP System"
Jerome Chailloux (INRIA), Matthieu Devin (Ecole des Mines de Paris), and Jean-Marie Hullot (INRIA)
"DIALISP - A LISP Machine"
G. Stefan, A. Paun, A. Birnbaum, and V. Bistriceanu (Functional Institute of Bucharest)
"Recent Developments in ISI-Interlisp"
Raymond L. Bates, David Dyer, and Mark Feber (University of Southern California Information Sciences Institute)
"TAO: A Fast Interpreter-Centered Lisp System on Lisp Machine ELIS"
Hiroshi G. Okuno, Ikuo Takeuchi, Nobuyasu Osato, Yasushi Hibino, and Kazufumi Watanabe
(Nippon Telegraph and Telephone Public Corporation)
"The Design of an Instruction Set for Common Lisp"
Skef Wholey and Scott E. Fahlman (Carnegie-Mellon University)
! 4
TUESDAY MORNING, AUGUST 7, 1984
09:00 AM Session 6
Chairman: Peter Henderson (University of Stirling)
"Some Practical Methods for Rapid Combinator Reduction"
W. R. Stoye, T. J. W. Clarke, and A. C. Norman (University of Cambridge)
"Experiments in Diffused Combinator Reduction"
Paul Hudak and Benjamin Goldberg (Yale University)
Invited talk: "Expression Evaluation in the ICON Programming Language"
Ralph E. Griswold (University of Arizona)
10:40 AM Coffee break
11:05 AM Session 7
Chairman: William L. Scherlis (Carnegie-Mellon University)
"Modules for Standard ML"
David MacQueen (AT&T Bell Laboratories)
"Compiling a Functional Language"
Luca Cardelli (AT&T Bell Laboratories)
"A Compiler for Lazy ML"
Lennart Augustsson (Chalmers University of Technology)
12:20 PM Lunch
! 5
TUESDAY AFTERNOON, AUGUST 7, 1984
2:10 PM Session 8
Chairman: Martin L. Griss (Hewlett-Packard)
"Recursion is More Efficient than Iteration"
Emmanuel Saint-James (Universite Pierre et Marie Curie)
"Garbage Collection Techniques for Lisp"
David A. Moon (Symbolics, Incorporated)
"Steps Toward Better Debugging Tools for Lisp"
Henry Lieberman (Massachusetts Institute of Technology)
"Trading Data Space for Reduced Time and Code Space in Real-Time Garbage Collection on Stock Hardware"
Rodney A. Brooks (Stanford University)
03:50 PM Coffee break
04:15 PM Session 9
Chairman: Dana Scott (Carnegie-Mellon University)
"Type Inference and Type Checking for Functional Programming Languages"
Takuya Katayama (University of North Carolina at Chapel Hill)
"A Powerful Strategy for Deriving Efficient Programs by Transformation"
Alberto Pettorossi (Edinburgh University)
"Busy and Lazy FP with Infinite Objects"
Walter Dosch and Bernhard Moeller (Technische Universitaet Muenchen)
"Continuations and Coroutines: An Exercise in Meta-Programming "
Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand (Indiana University)
05:55 PM Break before banquet
07:30 PM[?] Banquet. [Raymond Smullyan has been invited. Not yet confirmed.]
! 6
WEDNESDAY MORNING, AUGUST 8, 1984
09:00 AM Session 10
Chairman: David Warren (Silogic Incorporated)
Invited talk: "On the History of LISP"
Herbert Stoyan (University of Erlangen)
"Making Control and Data Flow of Logic Programs More Explicit"
Gert Smolka (Cornell University)
"TABLOG: The Deductive Tableau Programming Language"
Yonathan Malachi (Stanford University), Zohar Manna (Stanford University), and Richard Waldinger (SRI International)
10:40 AM Coffee break
11:05 AM Session 11
Chairman: Robert Cartwright (Rice University)
"The Implementation of Procedurally Reflective Languages"
Jim des Rivieres and Brian C. Smith (Xerox Palo Alto Research Center)
"Reification: Reflection without Metaphysics"
Daniel P. Friedman and Mitchell Wand (Indiana University)
"The Scheme 311 Compiler: An Exercise in Denotational Semantics"
William Clinger (Indiana University)
12:20 PM End of conference
-------
-------
∂25-Apr-84 1457 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 14:57:02 PST
Date: Wed 25 Apr 84 14:52:13-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Thanks for you splendid effort; I think we have a good exam.
I will distibute the current reading list, together with some changes that
have been proposed, so that we can think about it and draft a proposal
to the CSD faculty at our last meeting.
Rob
-------
∂25-Apr-84 1502 SCHREIBER@SU-SCORE.ARPA Paying the pretesters
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 15:01:57 PST
Date: Wed 25 Apr 84 14:58:08-PST
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Paying the pretesters
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Send name of your pretester to Marilyn (MWALKER @ Score). RS
-------
∂25-Apr-84 1600 DFH
To: JMC, DFH
Gene Lawlor called re your talk tomorrow in Berkeley. Said it was to be
at Cory Hall, 5 p.m. and he would have a viewgraph for you.
If you drive, you should go to the East Gate where there should be a
parking permit for you.
Said at this point he had made no arrangements for dinner or the evening,
but if you wish to stay, he will make such arrangements.
∂25-Apr-84 1603 DFH
To: JMC, DFH
Lawlor's phone is 642 4019.
∂25-Apr-84 1604 ME AP and tty exist
∂16-Mar-84 1050 JMC
I suggest that the NS greeting mention tty exist till the NS fans know about it.
ME - The problem with advertising this in general is that someone may try
(dare I say what) the opposite, which will turn the AP line off, with no
indication of why. Informing interested local individuals seems safer.
∂25-Apr-84 1709 TW Space for Vardi
To: JMC@SU-AI.ARPA
CC: TW@SU-AI.ARPA, MYV@SU-AI.ARPA, barwise@SU-CSLI.ARPA,
briansmith@XEROX.ARPA
Moshe Vardi will be a postdoc at CSLI next year. Since space in the new
trailers is scarce, we have been asked to look for space in the
departments for the postdocs. I have already asked for other such space
for CSLI purposes, and anyway you have more clout than I do. Are you
willing to ask for a space for him, or do you already have one that will
be vacated by then? If you want more details on what he will be doing, it
is probably best to check with him directly.
Thanks --t
∂25-Apr-84 1820 @MIT-MC:rwg@SPA-NIMBUS RWW's terminal and modem
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 18:20:32 PST
Received: from SPA-RUSSIAN by MIT-OZ via Chaosnet; 25 Apr 84 21:20-EST
Date: Wednesday, 25 April 1984, 18:19-PST
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: RWW's terminal and modem
To: jmc at MIT-OZ
(Trying again)
DEC VT131, Hayes Smartmodem 1200. The latter is spiffy and probably pricey.
I think I heard a rumor that the DEC terminal is amazing cheap to produce,
at least.
"rwg%spa-nimbus"@mc
thanks
thanks
∂25-Apr-84 2015 @MIT-MC:rwg@SPA-NIMBUS mc
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 20:15:00 PST
Received: from SPA-RUSSIAN by MIT-OZ via Chaosnet; 25 Apr 84 23:13-EST
Date: Wednesday, 25 April 1984, 20:12-PST
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: mc
To: jmc at MIT-OZ
JPG@MIT-MC 04/25/84 18:15:40 Re: Chudnovskys
To: RWG at MIT-MC
CC: JPG at MIT-MC
RWG@MIT-MC 04/25/84 01:09:42
jmc says that the Chudnovskys, being in Columbia's math dept instead
of CS, are woefully short of computrons. (They seem to be on the outs
with Traub for some reason.) Who and how should they approach re using
MC?
I think you're going to have a tough time with this. The people who grant
accounts on MC are essentially CSTACY and KMP. But I don't see them giving
in on this one. You'll have to convince DCLARK. He's the current head of
Computing Services for LCS. If you convince him, CSTACY et al will go along.
------
Additional complication: Someone convinced CSTACY that I was "slandering" him.
I am at a complete loss to explain why.
∂26-Apr-84 0107 @MIT-MC:rwg@SPA-NIMBUS nyc macsyma
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 26 Apr 84 01:06:56 PST
Date: Thu, 26 Apr 84 01:05 PST
From: Bill Gosper <rwg%SPA-NIMBUS@MIT-MC.ARPA>
Subject: nyc macsyma
To: cwh.ih%MIT-OZ@MIT-MC.ARPA
Cc: JMC@SU-AI.ARPA, cwh%SPA-NIMBUS@MIT-MC.ARPA
I met two remarkable mathematicians (David and Gregory Chudnovsky) from
Columbia during the recent NYU computer algebra conference, and have
since learned that they do not use Macsyma. CWH says you might know
of a Macsyma installation thereabouts which they could try out. Any
suggestions will be much appreciated, as this might be like replacing
Beethoven's Broadwood with a Bosendorfer.
∂26-Apr-84 0134 HST lisp history
i write my talk for austin just now and detected the following:
in the"proposal for a programming language" which is the paper the
acm peiople brought to zurich in june 1958 conditional expressions
appear in 3 forms! (first,as expression arguments for GOTO-statements,
second,as control statement per se, and third, as substitution statement)
the last is really only identical syntax.
in consequence,the invention of conditional expressions must have happened
in spring of 1958 or winter 1957.
i got my letter back from carr - the address was wrong.do you know the
correct one?(and additionally: the net-address of bill clancy)
i must remind you for the old photographs.
∂26-Apr-84 0151 ME news summaries
To: G.Gorin@LOTS-A, Bosack@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA
Because we make the NYT news summaries readily available to Sail users in
a local file here, some network users at other sites have taken to FTPing
the summaries regularly and distributing them, fairly widely I suppose (I
have no idea really how widely). I always considered this fairly
insignificant in that it didn't provide whole stories, just story leads
(and maybe would even make people buy more newspapers, since the remote
readers of the summary couldn't get to our online news). I still think
that the NYT really wouldn't care if they understood, but of course it
might not be possible to really make them understand that the rest of the
news isn't available outside of Sail.
At any rate, we have discontinued the distribution, as far as I know, of
both the AP digest and the NYT summary, by protecting the local files from
unlogged in users (including FTP) and by terminating a daily mailing that
MRC was doing of these two files to MIT. (It's possible that other
legitimate Sail users might be doing something similar, but I doubt it.)
This is not to imply that I think we were wrong in distributing the news
summaries in the first place, although it may be hard to justify that
distribution on the basis of some research (here or elsewhere).
∂26-Apr-84 0458 @COLUMBIA-20.ARPA:STAFF.HERSHMAN@NYU20 nyc macsyma
Received: from COLUMBIA-20.ARPA by SU-AI.ARPA with TCP; 26 Apr 84 04:58:24 PST
Received: from NYU20 by CUCS20 with DECnet; 26 Apr 84 07:58:29 EST
Date: 26 Apr 1984 07:58 EST (Thu)
Message-ID: <STAFF.HERSHMAN.12010531210.BABYL@NYU20>
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
To: Bill Gosper <rwg@MIT-MC>
Cc: cwh.ih@MIT-OZ, cwh@MIT-MC, Ittai@NYU20, JMC@SU-AI
Reply-to: Ittai@MIT-MC
Subject: nyc macsyma
In-reply-to: Msg of 26 Apr 1984 01:05-PST from Bill Gosper <rwg at SPA-NIMBUS>
Date: Thursday, 26 April 1984, 01:05-PST
From: Bill Gosper <rwg at SPA-NIMBUS>
To: cwh.ih at MIT-OZ
cc: JMC at SU-AI, cwh at SPA-NIMBUS
Re: nyc macsyma
I met two remarkable mathematicians (David and Gregory Chudnovsky) from
Columbia during the recent NYU computer algebra conference, and have
since learned that they do not use Macsyma. CWH says you might know
of a Macsyma installation thereabouts which they could try out. Any
suggestions will be much appreciated, as this might be like replacing
Beethoven's Broadwood with a Bosendorfer.
Hmmm. I'll have to look into it. I suspect that one of Columbia's
vaxen must be running Macsyma-- I'll ask and get back to you...
-Ittai
∂26-Apr-84 1100 MULLEN@SUMEX-AIM.ARPA siglunch
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Apr 84 11:00:03 PST
Date: Thu 26 Apr 84 10:21:27-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: siglunch
To: jmc@SU-AI.ARPA
Do you need anything for your talk tomorrow other than an overhead
projector???pls let me know today if possible.
-------
An overhead projector will suffice.
∂26-Apr-84 1130 DFH
To: JMC, DFH
John Coxe's secretary called to say that she had been able to get
reservationns for you from the 6th to the 9th at Tarrytown, EXCEPT for
the 8th. She wants to know if you wish to switch entirely to Mt. Cisco
Holiday Inn or just for one night, the 8th.
If you will let me know, I can call her back, or you may call her,
Marcia Bower, at 914 945 1286.
Please tell her I'll take Mt. Kisco and ask her how to get there
from the Taconic Parkway.
P.S. That's John Cocke.
∂26-Apr-84 1621 DFH
To: JMC, DFH
Leslie Pack called to say she tried to deliver the papers to R. Reiter
but he has checked out of Holiday Inn. She will bring them back to the
office.
∂26-Apr-84 1626 MA qual date
Would it be possible to change it to May 17? Apparently, there was a
misunderstanding between Zohar and I when we talked about May 18.
Thanks.
Martin
∂27-Apr-84 0900 GEORGEFF@SRI-AI.ARPA Planning/Concurrency workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Apr 84 09:00:42 PST
Date: Fri 27 Apr 84 09:02:58-PST
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Planning/Concurrency workshop
To: jmc@SU-AI.ARPA
Dear John,
Fernando Pereira and I are organizing a workshop on concurrent
programming and multi-agent planning, to be held sometime this year
(probably summer), under CSLI sponsorship. Here is a ROUGH
description of what we intend, together with a list of possible
speakers (as you can guess, you are one of them):
-----------------------------------------------------------------
WORKSHOP ON REASONING ABOUT COOPERATING AGENTS AND CONCURRENT PROCESSES
Reasoning about the behaviour of multiple agents or processors acting
together is a central concern of computer science, philosophy and
linguistics.
Research in concurrent programming is primarily concerned with
verification of the correctness of concurrent programs, i.e., given
information on the behaviour of program segments, determine whether or
not the behaviour of some concurrent program composed of these
segments satisfies some global specification. In artificial
intelligence, multi-agent planning aims to find techniques for
synthesizing plans, i.e., given information on the effects of certain
actions, determine a possible composition of these actions such that
some overall goal is achieved. In philosophy and linguistics, we need
to be able to ascribe meaning to action sentences, and to reason about
the beliefs, desires, intentions and acts of agents. All these
endeavours require reasoning about the effects of performing actions
concurrently in a possibly dynamic environment, and require a
semantics of action rich enough to do this reasoning.
As programming becomes more widely applied to specifying actions in
the real world (such as robot actions), there is a need to generalize
the techniques of concurrent programming verification to deal with a
wider class of actions than currently considered in that field.
Research in artificial intelligence, while having some solutions to
the problem of specifying properties of actions in general, needs to
consider more complex forms of composing these actions and reasoning
about their effects. And philosophy and linguistics need a stronger
theory of semantics of action in order to better understand the
relation between beliefs, desires, intentions and acts.
This workshop attempts to bring together researchers in computer
science, philosophy and linguistics to examine these problems. In
particular, we aim to thoroughly explore the core issues ---
what is a suitable semantics for actions, and what methods or logics
exist for reasoning about the behaviour of multiple agents acting
together in a dynamic environment, with perhaps conflicting desires
and incomplete knowledge.
Possible Speakers:
(temporal logics - program verification)
Amir Pnueli (or Howard Barringer, Ruurd Kuiper)
David Harel
Leslie Lamport
(other logics - program verification)
C.A.R. Hoare
Vaughan Pratt
Will Clinger
(logics and program synthesis)
Pierre Wolper (or Zohar Manna)
Richard Waldinger
(temporal logics - AI)
Drew McDermott
James Allen
(plan synthesis - AI)
Stan Rosenschein
Michael Georgeff
John McCarthy
(practical reasoning)
Michael Bratman
Bob Moore
Jon Barwise
---------------------------------------------------------------
Fernando and I would be most grateful if you could speak at the
workshop about the difficulties in reasoning about general kinds of
action (in comparison to particular actions such as the assignment
operator), with particular reference to the frame problem. We would
also like you to outline some "solutions", in particular
circumscription.
I know you have been giving lots of talks lately, and are probably
reluctant to give any more. However, your contribution would be
immensely valuable, and I would hope that you could gain something
from the workshop also.
I also remember you saying at one time that you had some ideas on how
to reason about concurrent actions. If my memory is correct, and you
wish to say something on these ideas, that would be excellent.
Please let me know if you would you be HAPPY (or at least NOT TOO
UNHAPPY) to do this.
Michael Georgeff
-------
georgeff%sri-ai
concurrent planning workshop
Thanks for inviting me to speak at your concurrent action workshop.
Assuming no problem with the date, I would very much like to do so
and hear what others have to say. You correctly remember that I
said I had some ideas about how to formalize rules giving the
consequences of action when other events are taking place concurrently.
We'll see if I really do.
Incidentally, if the workshop needs money, AAAI has a program of sponsoring
workshops with up to $5,000 apiece. Such money is most commonly used
for the transport of the impecunious.
∂27-Apr-84 1114 DFH
To: JMC, DFH
∂26-Apr-84 1134 JMC
Please tell her I'll take Mt. Kisco and ask her how to get there
from the Taconic Parkway.
She is mailing directions to you today.
∂27-Apr-84 1126 DFH
To: JMC, DFH
John Cocke's secretary called back to give you the confirmation
number for your reservation at the Holiday Inn in Mt. Kisco.
8476A506
∂27-Apr-84 1143 MULLEN@SUMEX-AIM.ARPA SIGLUNCH for today
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Apr 84 11:42:42 PST
Date: Fri 27 Apr 84 11:40:13-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH for today
To: jmc@SU-AI.ARPA
Doug Lenat asked me to remind you that you are giving the Siglunch today..
it is in Braun Lecture Hall in the Seely Mudd Bldg...if you are not sure
of this location, come to his office and you can walk over together.
-------
∂27-Apr-84 1545 JK
∂27-Apr-84 1541 JMC AI memos
What is the status of "publishing" your report on types, your paper
with Joe and the EKL manual itself as CSD reports (AI memos)?
-------
Joe and I will finish the manual within the next few weeks
The Language of EKL paper exists as a CSD report.
The types paper has not been published in any form.
∂28-Apr-84 1131 BARWISE@SU-CSLI.ARPA Minker
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Apr 84 11:31:31 PST
Date: Sat 28 Apr 84 11:31:08-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Minker
To: JMC@SU-AI.ARPA
John, Do you have a net address for Jack Minker of Maryland? He
invited me to a meeting and gave me the address minker@umct-cs
which does not work.
Jon
-------
∂28-Apr-84 1204 BARWISE@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 28 Apr 84 12:04:17 PST
Date: Sat 28 Apr 84 12:03:54-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 28 Apr 84 11:56:00-PST
Thanks
Jon
-------
∂28-Apr-84 2041 CLT me
i am in frans office
∂29-Apr-84 0024 GROSOF@SUMEX-AIM.ARPA comments on your draft paper
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Apr 84 00:24:03 PST
Date: Sun 29 Apr 84 00:21:49-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: comments on your draft paper
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
I wanted to correct a mistaken comment I made on you draft: in the
pacifist example, Pacifist indeed ought to be variable, but though there
are two minimal "solutions" to the circumscription, the circumscription
implies their disjunction. I was confused about what I was calling
"multiple extensions" the other day in your office. Circumscription
handles them "inside" the theory, just fine. It's even better than I
thought it was.
On another subject, it seems to me that if we express an inital theory
as A(Q;P) where Q is a tuple of parameters, and P is a tuple of variables,
then the circumscription implies nothing novel about any sentence of
the form B(Q), i.e. a sentence involving only the parameters. Also,
the circumscription is monotonic with respect to updates of the form
C(Q): that is, we needn't re-do the circumscription on A /\ C,
but rather can use Circumscription(A) /\ C. This is a powerful
reason to keep as many things as parameters as possible. Do you
agree with all this?
In translating default logic into circumscription, a key specification
is what to treat as variable. Naively, we can treat everything as
variable and still be consistent with the inferences that default
logic makes; however, because circumscription includes default inferences
"inside" the theory as implications, e.g. "bird /\ ~ostrich => flies",
for the above reasons, we want to keep as many parameters as possible.
Thus we might consider making only the consistency condition and the
consequent of default rules variable, and leave any left-over predicates,
i.e. those not mentioned in any consistency condition or consequent,
as parameters. Thus in the birds-fly example, we might imagine using
a Reiter-like specification of the default rules, to yield what to
treat as variable, e.g.
bird: flies /\ ~ostrich
-------------------------
flies
:~flies /\ ~bird
-----------------
~flies
canary => bird
bird(Joe)
would be treated as specifying that all predicates except canary are
variable. This would let us infer flies(Joe), which would not be the
case if we make ostrich a parameter.
In general, however, we will need some explicit specification of what
to treat as parameters/variables. Allowing for this, any circumscription
can be regarded as the image of some "translated" theory in Reiter's
default logic.
--Benjamin
-------
∂29-Apr-84 0058 GROSOF@SUMEX-AIM.ARPA Re: thanks for comments
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Apr 84 00:58:46 PST
Date: Sun 29 Apr 84 00:56:30-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: Re: thanks for comments
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 29 Apr 84 00:30:00-PST
Congratulations on the proposal. I'll try to come in to see you tomorrow
early afternoon, then.
Benjamin
-------
∂29-Apr-84 0900 JMC*
Hook
∂30-Apr-84 0801 PHY
Reminder, Chairman Search Committee meeting this afternoon
(Monday, April 30) 1:30 in MJH 352.
-Phyllis
∂30-Apr-84 1018 EMMA@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Apr 84 10:18:08 PDT
Date: Mon 30 Apr 84 10:18:25-PDT
From: Emma Pease <EMMA@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 27 Apr 84 23:38:00-PST
We had a mail problem at csli which caused a major delay in sending out
messages. In the future notices should arrive on time.
-------
∂30-Apr-84 1645 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- Friday, May 4, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Apr 84 16:45:46 PDT
Date: Mon 30 Apr 84 16:40:24-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- Friday, May 4, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, May 4, l984
LOCATION: Chemistry Gazebo, between Organic & Physical Chemistry
TIME: 12:05
SPEAKER:
TOPIC: COMPUTER SCIENCE PROBLEMS FOR THE 1980'S
Prof. Michael Dertouzos
Director of the Laboratory for Computer Science, MIT
VIDEOTAPE
This is another videotape from the tenth anniversary celebration
conference held at Information Science Institute in 1982. In this
lecture, Dr. Dertouzos surveys a variety of interesting areas of
computer science research and application for the 1980s, and does it
in a most entertaining fashion!
-------
∂30-Apr-84 1715 ERIC@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Apr 84 17:14:55 PDT
Date: Mon 30 Apr 84 17:15:05-PDT
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 27 Apr 84 22:48:00-PST
Yeah, sigh. We had major lossage with our mailer last week.
-------
∂01-May-84 1013 GEORGEFF@SRI-AI.ARPA Concurrency/planning workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 May 84 10:13:25 PDT
Date: Tue 1 May 84 10:14:25-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Concurrency/planning workshop
To: jmc@SU-AI.ARPA
John,
We are trying to set up a time for the concurrency/planning workshop.
Are there any periods in July/August when you would NOT be available?
(I assume you will not be available August 6-10).
Mike.
-------
Apart from AAAI, I will be available except for Aug 15 and 20 (one day each).
∂01-May-84 1337 PHY lunch
Don has to attend a lunch with SITN on Monday May 14 -- the same day
that he arranged with you to have lunch at the Faculty Club. Would
it be possible to meet instead on Wednesday May 16?
-Phyllis
May 16 isn't possible for me to meet with Don. Any other day that week
is ok.
∂01-May-84 1512 LEP Redone proof of unique names
I have redone the unique names proof, including the necessary condition to make
our substituted relation really symmetric. I ran into many difficulties with EKL's
derive procedure, which caused me to have to do it in many small steps. It is
now 61 lines long (instead of 22). I spoke with Jussi about it, but he says to
wait until he has the new DERIVE procedure working. It is currently (uncommented)
in neweq.ppr[1,lep]. If you decide you want to use it despite the length, I'll
insert the old comments and add some new ones explaining what I'm up to in the
more confusing places.
If you would like to talk about this while you're here (just for the weekend, isn't
it?), call me at home.
I tried to deliver the papers to Raymond Reiter's hotel, but he had already
checked out. I left them with your secretary.
I think IIll try to work next on the problem you proposed with two levels of
circumscription and property inheritance. First, do the penguins aren't noormally
rocks, then do the inheritance of flying.
If you have other things for me to think about, please let me know.
- Leslie
As for the unique names proof, we can wait for the new DERIVE. Otherwise,
how about meeting me at 4pm in my office Saturday.
∂01-May-84 1605 reiter%ubc.csnet@csnet-relay.arpa unique names reference
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 1 May 84 16:05:13 PDT
Received: From ubc.csnet by csnet-relay; 1 May 84 18:46 EDT
Received: from ubc-vision.UUCP (ubc-vision.ARPA) by ubc-ean.UUCP (4.12/3.14)
id AA01448; Tue, 1 May 84 14:15:32 pdt
Date: Tue, 1 May 84 14:15:41 pdt
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8405012115.AA08979@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA08979; Tue, 1 May 84 14:15:41 pdt
To: JMC@su-ai.arpa
Subject: unique names reference
The unique names reference is:
Reiter, R. Equality and domain closure in first order data bases. J.ACM, 27,
Apr. 1980, 235-249.
That paper also introduces the concept of a domain closure axiom for theories
with finite Herbrand universes {t1,...,tn) which states that these are the only
objects: (x)x=t1 V ... V x=tn.
Domain closure is what your domain circumscription tries to characterize, in a
more general way than does my domain closure axiom. In the draft paper by
Etherington, Mercer and myself (which you have) we claim that predicate
circumscription cannot yield a domain closure axiom. Have you thought about
how to do this using your approach to equality?
∂02-May-84 0613 BH LISP history question
What does the F stand for in FEXPR and FSUBR?
I didn't introduce it, and I don't know. If it's in the LISP 1.5
manual, you might try Dave Luckham, but if it didn't appear until
Maclisp try Greenblatt.
∂02-May-84 0843 DFH
∂02-May-84 0827 Mailer failed mail returned
In processing the following command:
MAIL jmc ∂25-Apr-84 1622 TAJNAI@SU-SCORE.ARPA JMC
The following message was unsent because of a command error:
------- Begin undelivered message: -------
∂02-May-84 0827 DFH JMC
To: JMC
∂25-Apr-84 1622 TAJNAI@SU-SCORE.ARPA JMC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Apr 84 16:22:04 PST
Date: Wed 25 Apr 84 16:10:09-PST
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: JMC
To: dfh@SU-AI.ARPA
Fran, I'm not certain I'm properly deciphering John's handwriting.
Does this make sense?
He has also developed a system of non-monotonic reasoning called
circumscription that can be used to represent in a flexible way the
conjecture that the entities that can be shown to exist on
the basis of the information in a certain data base are all the
relevant entities that exist.
???
Carolyn
-------
John, Caroline wants to know if she has your note properly interpreted.
------- End undelivered message -------
tajnai@score
handwriting interpretation
Your interpretation is correct.
∂02-May-84 1530 GARDNER@SU-SCORE.ARPA Expert systems and common sense
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 May 84 15:29:57 PDT
Date: Wed 2 May 84 15:12:33-PDT
From: Anne Gardner <GARDNER@SU-SCORE.ARPA>
Subject: Expert systems and common sense
To: jmc@SU-AI.ARPA
Is the paper available on which your Siglunch talk was based? If so,
I'd like to pass in on to the law faculty who are getting interested
in expert systems.
--Anne
-------
It's called Some Expert Systems Need Common Sense, and you can get it
from my secretary Fran Larson, who is known as DFH to SAIL.
∂02-May-84 1533 AAAI-OFFICE@SUMEX-AIM.ARPA workshop proposal
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 2 May 84 15:33:04 PDT
Date: Wed 2 May 84 09:01:01-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: workshop proposal
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Below is a proposal from B. Chandraskaran requesting suppor for an AIM
workshop.
Claudia
Subject: Support for AIM workshop
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: PSZ@MIT-MC.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Chandrasekaran@RUTGERS.ARPA, Jsmith@RUTGERS.ARPA
Attention : Ms. Claudia Mazzetti
Artificial Inteligence in Medicine Workshops are an annual event
where AIM researchers get together to discuss the research issues,
demonstrate their systems, and critique the approaches. These meetings
are run under the overall control of Sumex-Aim Executive Committee.
The 1984 AIM Workshop will be held at The Ohio State University, under
the directorship of myself and Dr. Jack Smith, and the dates are June 30
-- July 3.
Normally NIH has been supporting the Workshops by giving the organizers
a grant that covers travel costs of the participants and other organizational
expenses. This year for various reasons the grant funds available are
a much smaller proportion of the total costs. In particular no travel
grant is available. This is particularly damaging to the prospects of
graduate student attendance, which has been one of the great strengths of
earlier workshops.
I am told that AAAI has some funds that may be potentially available
for support of technical workshops such as this. I would like to begin
to explore the prospects of obtaining AAAI support for the 84 Workshop.
Please let me know what I should be doing, who I should talk to, what
sorts of funding size would be reasonable to seek, etc. I realize that
this process is being started somewhat late, but it couldn't be
avoided since the normal source of funding, viz., NIH, made their
decision only recently.
It seems that such a support from AAAI to this Workshop may be especailly
appropriate given the rather percentage of AAAI membership that is interested
in AIM issues.
I would appreciate any help, suggestions, etc., on how to proceed.
Thanks in advance.
-------
Claudia, here is a corrected version. I toned down a few expressions.
My additions are in caps, but note also the deletions.
∂02-May-84 1534 AAAI-OFFICE@SUMEX-AIM.ARPA Letter
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 2 May 84 15:34:02 PDT
Date: Wed 2 May 84 11:13:31-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Letter
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
If we want UT's Pres. Flawn to give a brief welcoming address to
the first assembly of all the conference attendees, I've been advised
we will need to write a letter to Flawn from you. I've taken
the liberty to compose such a letter (pls excuse the hipe in the
last paragraph).
Claudia
Dr. Peter T. Flawn, President
University of Texas
Austin, TX 78712
Dear Dr. Flawn:
The American Association for Artificial Intelligence is planning to
hold its fourth National Conference on Artificial Intelligence from
August 6 to 10, 1984 on the University of Texas at Austin campus.
The Departments of Computer Science and Mathematics are our gracious
co-sponsors of this year's conference.
This year we anticipated to have approximately 2,500 computer
scientists, mathematicians, computational linguists, engineers, and
government scientists attending this conference.
We cordially invite you or [SOMEONE YOU DESIGNATE] to welcome the
first assembly of all the conference attendees on Thursday, August 9,
11:00 a.m., in the Concert Hall of the Performing Arts Center.
We appreciate the hospitality of the University in sharing its
facilities for our conference. This annual conferenCe is the most
significant activity of our organization of any year. With
the GROWING interest IN artificial intelligence,
and with the HELP of the University of Texas at
Austin, we feel that the August 1984
conference in Austin will be our best effort ever.
Sincerely,
John McCarthy
President
JMC/CCM/kk
-------
∂02-May-84 1544 ABADI@SU-SCORE.ARPA yet a new date for mtc quals?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 May 84 15:44:44 PDT
Date: Wed 2 May 84 11:58:13-PDT
From: Martin Abadi <ABADI@SU-SCORE.ARPA>
Subject: yet a new date for mtc quals?
To: jmc@SU-AI.ARPA
Probably... I have been ill for a few days, and I will not be able to work
very hard for a few more days -- and then there is the cade. Though I
could pass now (?), I would feel more comfortable after rereading some of
the books in list, and I would like to know mtc better. Zohar would
recommend having the qual sometime in the summer. That would be good for
you, or wouldn't it?
Martin
-------
I have not problem with having the MTC qual in the summer. Almost any
time will do. Let me know when you are ready to propose a date.
∂02-May-84 1548 SCHREIBER@SU-SCORE.ARPA Comp Schedule
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 May 84 15:48:04 PDT
Date: Wed 2 May 84 12:45:42-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Comp Schedule
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
cc: golub@SU-SCORE.ARPA
Unless I hear a serious objection, the schedule for the comp is
Saturday morning, May 19:
9:00 -- Software
10:15 -- AA
11:30 -- NA
Sunday afternoon, May 20:
1:00 -- MTC
2:15 -- AI
3:30 -- Hardware
Rob
-------
∂02-May-84 1634 CG
John,
We at Silma finally have some demonstrations of integrated vision and
manipulation running. I'd be very pleased if you could come down sometime
to see the demos and talk. I can be reached at 493-0145 to set something
up.
Also, by the time you read this, I will have generated the final report
for the NSF grant.
Chris
I'll be away till the 11th, so I'll phone the week of the 13th.
∂03-May-84 0154 CL.BOYER@UTEXAS-20.ARPA Texas
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 3 May 84 01:54:43 PDT
Date: Wed 2 May 84 19:39:30-CDT
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Texas
To: feng@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, cl.moore@UTEXAS-20.ARPA
I am sorry to say that Moore and I have more PhD students
that we have agreed to advise than we really should.
Consequently we cannot invite another student to work with
us at this time. We have several students here who are from
the People's Republic of China, including Chou, whom you
know. These students are exceptionally good, and I am
disappointed to turn you down.
-------
∂03-May-84 0958 DFH
To: JMC, DFH
Your ticket is in current affairs file.
∂03-May-84 1127 DFH
To: JMC, DFH
We have just about completed the renewal proposal for the McCarthy-
Ketonen NSF grant. I have left the proposal cover sheet in your
office for your signature.
∂03-May-84 1538 AAAI-OFFICE@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 May 84 15:38:06 PDT
Date: Wed 2 May 84 16:57:41-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Do you want to prepare a Presidential message in the next issue of the
magazine? The due date for its submission is May 21.
Claudia
-------
I'll try for a presidential message.
∂03-May-84 1600 TAJNAI@SU-SCORE.ARPA Prof. Samuel
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 May 84 15:49:52 PDT
Date: Thu 3 May 84 14:36:07-PDT
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Prof. Samuel
To: jmc@SU-AI.ARPA
John, I have been trying to get Dr. Samuel to contribute something to
the "Research Interests" booklet that I'm editing. He was not in the
last few CS annual reports. I have written something using information
from the Campus Reports. What do you think?
@b{Arthur L. Samuel,} Professor of Computer Science, Research, Emeritus@\
Professor Samuel helped build one of the world's first computers and
helped IBM build its first computer. He also developed one of the
earliest known programs to use artificial intelligence, a famous
program that plays checkers and could actually learn by experience.
Almost forty years after he developed that program, he still has a
copy working on SAIL, a DECsystem 1080. In the early 1960's, he
became the first person to predict home computers, projecting that
they would be common by 1984. When Professor Samuel reached
retirement age he was encouraged by John McCarthy to come to Stanford,
and he rewrote the checker program for a DEC 20 on campus.
He is now involved in Donald Knuth's TEX project.
Professor Samuel received an honorary doctorate from MIT in 1946
-------
tajnai%score
samuel
Please phone him 7-3330 and get his approval.
∂03-May-84 1607 LENAT@SU-SCORE.ARPA AI QUAL THIS JUNE
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 May 84 15:53:38 PDT
Date: Thu 3 May 84 15:01:28-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: AI QUAL THIS JUNE
To: feigenbaum@SU-SCORE.ARPA, buchanan@SU-SCORE.ARPA, jmc@SU-AI.ARPA,
tw@SU-AI.ARPA, tob@SU-AI.ARPA, genesereth@SU-SCORE.ARPA
cc: MWALKER@SU-SCORE.ARPA, lenat@SU-SCORE.ARPA
The AI Qual will again be an oral exam, by triples of us (and
friends if need be), given on Wednesday, June 6. Please let me know
any times that day between 9 am and 5 pm that you CANNOT be present
for an examinee or a group meeting -- I will assign committees
in the next few weeks.
Marilyn: Please make sure that students who want to take the qual
are signing up for it. Let me have the current list online every couple weeks.
Close the sign-up on June 1. Thanks, all!
Doug
-------
∂03-May-84 1644 GROSOF@SUMEX-AIM.ARPA [Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>: Abstracts]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 May 84 16:44:19 PDT
Date: Thu 3 May 84 16:43:04-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: [Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>: Abstracts]
To: jmc@SU-AI.ARPA
jmc@sail
---------------
Return-Path: <reiter%ubc.csnet@csnet-relay.arpa>
Received: from csnet-relay by SUMEX-AIM.ARPA with TCP; Thu 3 May 84 16:10:21-PDT
Received: From ubc.csnet by csnet-relay; 3 May 84 18:56 EDT
Received: from ubc-vision.UUCP (ubc-vision.ARPA) by ubc-ean.UUCP (4.12/3.14)
id AA01118; Thu, 3 May 84 15:49:09 pdt
Date: Thu, 3 May 84 15:49:23 pdt
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8405032249.AA14485@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA14485; Thu, 3 May 84 15:49:23 pdt
To: grosof@sumex-aim.arpa
Subject: Abstracts
Benjamin:
Ray suggests that I keep my talk on
circ'n down to a reasonably non-technical
level (i.e. don't go into the details of
the proofs, and deal only with the results,
the motivations for them, and their repercussions).
This would mean that the talk would probably
run no more than 30 minutes. He has suggested
that I do 2 talks, one on our results on
circ'n and the other on our AAAI-83 paper.
The latter would essentially be the same as
the talk I gave at AAAI, although I have a
few additional comments about the subsequent
work of the NETL group vis a vis these results.
Anyway, I am in a bit of a quandry. I can do
either, spinning the circ'n talk out to 45
minutes plus questions (allowing more time
for discussion) or keeping to two shorter talks.
How do you and JMc feel about the alternatives?
Either way, I have attached both abstracts,
so that you can get whichever you choose
out.
I will be phoning you Friday to let you
know my plans, so we can talk about it then.
Regards,
David.
Drawing A Line Around Circumscription
David W. Etherington
Department of Computer Science
The University of British Columbia
Abstract
The Artificial Intelligence community has
been very interested in the study of reasoning
in situations where only incomplete information
is available. Predicate Circumscription and
Domain Circumscription provide tools for non-
monotonic reasoning in such situations.
However, not all of the problems which might
be expected to yield to circumscriptive inference
are actually addressed by the techniques which
have been developed thus far.
We outline some unexpected areas where existing
techniques are insufficient.
On Inheritance Heirarchies With Exceptions
David W. Etherington
Department of Computer Science
The University of British Columbia
Abstract
Using default logic, we formalize NETL-like
inheritance hierarchies with exceptions. This
provides a number of benefits:
1) A precise semantics for such hierarchies,
2) A provably correct (with respect to the proof
theory of default logic) inference algorithm
for acyclic networks,
3) A guarantee that acyclic networks have
extensions, and
4) A provably correct, quasi-parallel inference
algorithm for such networks.
-------
∂03-May-84 1728 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 May 1984
Previous Balance 0.90
Monthly Interest at 1.5% 0.01
-------
TOTAL AMOUNT DUE 0.91
Please deliver payments to Diana Hall, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂05-May-84 0127 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 May 84 01:24:32 PDT
Date: Fri 4 May 84 22:27:38-PDT
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 4 May 84 19:23:00-PDT
Sounds fine.
-------
∂05-May-84 1328 GROSOF@SUMEX-AIM.ARPA meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 May 84 13:28:26 PDT
Date: Sat 5 May 84 13:29:01-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: meeting
To: jmc@SU-AI.ARPA
Hi JOhn, I'm in MJ450. Anytime.
Benjamin
-------
∂05-May-84 1520 LEP Meeting
I just read your message, but couldn't $
∂05-May-84 2028 GROSOF@SU-SCORE.ARPA partial circn
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 May 84 20:25:28 PDT
Date: Sat 5 May 84 20:10:34-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: partial circn
To: jmc@SU-AI.ARPA
Hi John,
Sorry not to give you fuller version; but CRT fatigue is getting to me.
As I said, please try to think about the model theory for this, and for
the general case of non-directly minimized variables.
Benjamin
****DRAFT**** 5/5/84
GENERALIZING CIRCUMSCRIPTION
by Benjamin Grosof, Stanford University
MOTIVATION
It seems that in some circumstances, circumscription infers too much by way
of side-effect in achieving certain desired nonmonotonic inferences. In
general, the choice of which predicates to make variable in the minimization
is critical. The variable predicates prescribe and bound the liberty of the
minimization. But at the same time they are subject to being "side-affected"
by the minimization. Some of these side-effects may be undesirable. This
motivates us to develop a more generalized version of circumscription, which
we might think of in several ways: as partial, as bounded, or
as "quasi-protected".
Our new circumscription in form differs in only one respect: the
circumscriptive inference is only a partial converse, rather than a full
converse, of the "LTE condition". LTE here means "less than or equal".
Circ'd-A(P) ==
A(P) /\ (ALL Z). {A(Z) /\ [(ALL x). (E(Z,x) => E(P,x))]
=> [(ALL x). (E(P,x) /\ ~S(P,x) => E(Z,x))]}
The LTE condition is: [(ALL x). (E(Z,x) => E(P,x))].
The idea here is that the scope of the converse is delimited by a
quasi-protected "region" corresponding to S(P).
This partial circumscription allows us to model seminormality in default
reasoning in an elegant manner.
Suppose we wish to translate the seminormal rule from default logic:
A : B /\ C
----------
C
We can do this by writing:
E == A /\ ~(B /\ C) == ~(A => B /\ C)
S == ~ (A /\ ~C) == (A => C)
E /\ ~S == (A /\ ~C)
-------
∂05-May-84 2047 GROSOF@SUMEX-AIM.ARPA abstracts, default logic, circumscription; pls fwd to Etherington
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 May 84 20:47:45 PDT
Date: Sat 5 May 84 18:09:09-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: abstracts, default logic, circumscription; pls fwd to Etherington
To: reiter@RUTGERS.ARPA
cc: jmc@SU-AI.ARPA
!!!!N.B. Please forward to Etherington as well!!!!
Hello Ray, May 5, 1984
WORKSHOP ABSTRACTS
I have posted to you copies of the abstract of "Default Reasoning As
Circumscription", in both a shorter and a fuller version. I am
also sending you on-line copies as well, for convenience of printing,
forwarding, etc.. The OVERVIEW section in each serves as a sub-abstract.
NONSEMINORMAL DEFAULTS
I decided against discussing translating seminormal defaults in the abstract.
I've been thinking about it some more since we talked, and it seems to me
there are some issues of interpreting nonseminormal defaults, and defaults
with multiple consistency conditions, i.e. M(B1)/\ M(B2)/\..., that are
tricky and possibly controversial. Mapping nonseminormal defaults such as
A(x) :
-----------
C(x)
into first order implications A(x) => C(x), may not be appropriate. I'd
be interested in any thoughts you have on the subject of nonseminormal
defaults, especially any uses you have found for them.
SEMINORMAL DEFAULTS: A CHALLENGE (from a Devil's Advocate)
Do you have any argument as to why all seminormal defaults shouldn't be
normal? By that, I mean it seems intuitively reasonable to conclude the
"non-cancellation" condition which justifies the "main" consequent, as well:
in effect we are using it as an assumption. Concluding it aids consistency,
e.g. having an extension and guaranteeing semimonotonicity. The parsimony
of only concluding the "main" consequent may be nice in some sense, but is
it necessary and is it sound intuitively?
A : C /\ B A : C /\ B
i.e. convert ---------- to ---------- .
C C /\ B
In particular, this seems a reasonable proposal for coping with interacting
defaults in [Reiter and Criscuolo 1983] and [Etherington and Reiter 1983]:
all of the examples of seminormality could be obviated by the above approach.
What do you think?
NEW RESULTS ABOUT CIRCUMSCRIPTION IN GENERAL
I have been developing a body of results about circumscription, which may be
in shape to present at the workshop as well, if that was possible to arrange.
One particularly exciting lead is that I think I have a developed a
generalization of circumscription which allows only part of the circumscriptive
inference to be drawn. I will send you something written as soon as I have it
(if the idea survives!). The other work is on relating circumscribing
predicates to circumscribing expressions, on relating single to joint
circumscription, on relating single and joint circumscription to predicate
completion, and on proceduralizing circumscription for appropriate special
cases. The thrust of all this is to provide theorems and rewriting methods
to make working with circumscription more practicable.
PREDICATE COMPLETION: A REQUEST
!PLEASE! send me a copy of your proof that circumscription implies
predicate completion. Also, if you know of any other explication of Clark's
algorithm for getting a theory Horn in predicate P into the form of a
sufficency axiom (A(x) => P(x)), please let me know. I am actively working
in this area, and would greatly appreciate it.
UNIQUE NAMES AND CIRCUMSCRIBING EQUALITY
On the unique names front, Vladmir Lifschitz has proposed a solution which
involves making functions and constants variable as well as predicates. I
am working on showing that when we rewrite functions and constants in terms of
predicates, that his solution is basically equivalent to the ones that I and
McCarthy have proposed. The draft proof that I sent you and Etherington
about "circumscribing equality yields no new results" needs two modifications:
1) if equality is not variable but we allow functions and constants to be,
then we can conclude new results about equality. However, I think if only
predicates may be variable, then we can't.
2) an additional condition needed for interpreting the results of the proof as
meaning no new conclusions about equality, is that the circumscription be
consistent, i.e. for every model of the theory, there must be a minimal
sub-model.
INCONSISTENCY OF A CIRCUMSCRIPTION
Also, I've checked Etherington's inconsistency example and found it both
elegant and convincing.
Regards,
Benjamin
-------
∂06-May-84 0232 GROSOF@SU-SCORE.ARPA draft abstract and seminormality
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 May 84 02:32:36 PDT
Date: Sun 6 May 84 02:29:44-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: draft abstract and seminormality
To: jmc@SU-AI.ARPA
Hi John,
I've discovered an error in the "trick" for seminormality, after all. It was
too good to be true! So ignore the draft from part (2) of the EXAMPLE
onward, please.
Benjamin
-------
∂06-May-84 0558 GROSOF@SU-SCORE.ARPA partial circumscription
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 May 84 05:58:42 PDT
Date: Sun 6 May 84 05:55:49-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: partial circumscription
To: jmc@SU-AI.ARPA
Hi John,
I hope this isn't too late for you to get before you leave for your trip.
Below is a draft on partial circumscription, with an example.
One puzzle for me is how to think about the model theory. Also, I'm not
entirely convinced that the generalization is not so general that
it will be able to used to do pathological or inconsistent things.
Regards,
Benjamin
-------------------------------------------------------------------------
****DRAFT**** 5/5/84
GENERALIZING CIRCUMSCRIPTION
Introducing Partial Circumscription
by Benjamin Grosof, Stanford University
MOTIVATION
It seems that in some circumstances, circumscription infers too much by way
of side-effect in achieving certain desired nonmonotonic inferences. In
general, the choice of which predicates to make variable in the minimization
is critical. The variable predicates prescribe and bound the liberty of the
minimization. But at the same time they are subject to being "side-affected"
by the minimization. Some of these side-effects may be undesirable. This
motivates us to develop a more generalized version of circumscription, which
we might think of in several ways: as partial, as bounded, as restricted, or
as "quasi-protected". We will refer to it henceforth as "partial". In
particular, this new partial circumscription allows us to simulate seminormal
default logic in an elegant manner. Simulating seminormality also solves a
difficulty in simulating normal default logic which arises when defaults
conflict.
PARTIAL CIRCUMSCRIPTION
Our new circumscription in form differs in only one respect: the
circumscriptive inference is only a partial converse, rather than a full
converse, of the "LTE condition". LTE here means "less than or equal".
Circ'd-A(P) ==
A(P) /\ (ALL Z). {A(Z) /\ [(ALL x). (E(Z,x) => E(P,x))]
=> [(ALL x). (E(P,x) /\ S(P,x) => E(Z,x))]}
The LTE condition is: [(ALL x). (E(Z,x) => E(P,x))].
The idea here is that the scope of the converse is delimited by a
quasi-protected "region" corresponding to ~S(P). Or we might say that
it is restricted to E/\S(P).
Note that the usual "full" circumscription is just the special case of E => S.
Thus partial circumscription is a generalization of full circumscription.
The joint form of partial circumscription is analogous. For each Ei(P,x)
we specify an Si(P,x) as well.
AN OBSERVATION ABOUT PREDICATE COMPLETION
Partial circumscription does not in general imply predicate completion.
Thus in formulating a translation from default logic, for example,
we will need to use equivalences, not just one-way implications, in
adding axioms about newly introduced abnormal predicates.
THE PROBLEM OF SIMULATING SEMINORMALITY IN DEFAULT LOGIC
Partial circumscription allows us to model seminormality in default
reasoning in an elegant manner, something which does not seem to be possible
at all when using full circumscription.
Several likely-seeming approaches using full circumscription
fail to capture seminormality. Basically they are always normal, by
simulating either:
A /\ ~B : C A : B /\ C
----------- or ---------- .
C B /\ C
The proposal below is to use a partial circumscriptive version of the latter.
THE PROBLEM OF SIMULATING CONFLICTING NORMAL DEFAULTS
Indeed, even the case of two
conflicting normal defaults does not seem to be handled well by full
circumscription. Although full circumscription results in only one
extension rather than two (as in default logic) when there is conflict,
which is desirable, it in effect rewrites the prerequisites to express
the need for a guarantee against the conflict, something which default
logic does not do, and which seems highly undesirable. For example,
the two defaults
Quaker(x) : Pacifist(x) Republican(x) : ~Pacifist(x)
----------------------- and ----------------------------
Pacifist(x) ~Pacifist(x)
are in the circumscriptive formulation in effect rewritten to:
Quaker(x) /\ ~Republican(x) : Pacifist(x)
----------------------------------------- and
Pacifist(x)
Republican(x) /\ ~Quaker(x) : ~Pacifist(x)
------------------------------------------ .
~Pacifist(x)
Similarly, {assume (ostrich(x) =>bird(x)) is a first order axiom}
bird(x) : flies(x) ostrich(x) : ~flies(x)
------------------ and ----------------------
flies(x) ~flies(x)
are rewritten in effect to a single default, because one prerequisite
subsumes the other:
bird(x) /\ ~ostrich(x) : ~flies(x)
---------------------------------- .
~flies(x)
Partial circumscription allows us to solve these problems by rewriting the
defaults to be seminormal, as in [Reiter and Criscuolo 83] and [Etherington
and Reiter 83]. The problem of interacting defaults in circumscription is
different but, it appears, even more serious than in default logic. Rewriting
the interacting defaults as seminormal is vital to achieving the intended
behavior of the default in all situations other than those in which the
interaction is known to be ruled out; and these are typically most of the
situations. Detecting and rewriting interacting defaults before or during
the translation from default logic to circumscription therefore appears
essential.
TRANSLATING SEMINORMAL DEFAULT LOGIC INTO CIRCUMSCRIPTION
Suppose we wish to translate the seminormal rule from default logic:
A : B /\ C
----------
C
We can do this by writing:
E == A /\ ~(B /\ C) == ~(A => B /\ C)
S == (A /\ ~C) == ~(A => C)
{Here we have let S == E /\ S.}
Then we can treat both B and C as variable, yet not side-affect B. This is
the essence of the innovation in the context of translating default logic.
In translating a whole seminormal default theory, we would use the joint
version of this partial circumscription. This new method for translating
an individual seminormal default rule is just a modification and generalization
of the translation scheme from normal default logic into circumscription
that is proposed in "DEFAULT REASONING AS CIRCUMSCRIPTION".
EXAMPLE: Birds and Flying, Revisited
Suppose we have the seminormal default:
bird(x) : flies(x) /\ ~ostrich(x)
---------------------------------
flies(x)
and suppose we have a set of first order axioms:
bird(Tweety)
~bird(Fred)
ostrich(Joe)
ostrich(x) => bird(x)
Then we will make both ostrich and flies be variable, and set:
E(ostrich, flies, x) == ~(bird(x) => flies(x) /\ ~ostrich(x))
== (bird(x) /\ ~flies(x) \/ ostrich(x))
S(ostrich, flies, x) == ~(bird(x) => flies(x))
== (bird(x) /\ ~flies(x))
Then substituting for flies and ostrich in such a way that
bird(Tweety) /\ flies1(Tweety)
~ostrich1(Tweety) {this is a critical step; otherwise we can't infer
flies(Tweety) without already knowing ~ostrich(Tweety)}
i.e.
flies1(x) == (x=Tweety) \/ ((x=Joe) /\ flies(Joe))
ostrich1(x) == (x=Joe)
yields as our ONLY new circumscriptive inference/conclusion:
{E /\ S => E1}
bird(x) /\ ~flies(x) => bird(x) /\ ~flies1(x) \/ ostrich1(x); i.e. <=>
bird(x) /\ ~flies(x) => ~(x=Tweety) /\ (~(x=Joe) \/ ~flies(Joe)) \/ (x=Joe)
; i.e. <=>
bird(x) /\ ~flies(x) => ~(x=Tweety) \/ (x=Joe); i.e. <=>
bird(x) /\ ~flies(x) => ~(x=Tweety); i.e. <=>
flies(Tweety). {since we know bird(Tweety)}
So our sole new conclusion is that Tweety flies. What is significant is that
though ostrich was variable, we inferred nothing about whether Tweety being
not an ostrich. This is despite the fact that positing Tweety not being an
ostrich is critical to concluding Tweety is a bird.
Of course, we have not proved above that one cannot find a substitution for
flies1 and ostrich1 which would side-affect ostrich(x), but we find the example
suggestive and convincing.
The "negative space" of the partial circumscription is the inference NOT
drawn that a full circumscription on E would have drawn. In general this is
exactly:
(ALL x). [E(P,x) /\ ~S(P,x) => E(Z,x)] {in context of course}.
In this example, that would be:
ostrich(x) => bird(x) /\ ~flies1(x) \/ ostrich1(x); i.e. <=>
ostrich(x) => ~(x=Tweety) /\ (~(x=Joe) \/ ~flies(Joe)) \/ (x=Joe)
; i.e. <=>
ostrich(x) => ~(x=Tweety); i.e. <=>
~ostrich(Tweety).
In other words, we would conclude that Tweety must not be an ostrich. But
this corresponds rather to the NORMAL default:
A : B /\ C
----------.
B /\ C
VARIABLE FUNCTION AND CONSTANT SYMBOLS
We can generalize circumscription in another way as well: by permitting the
symbols of the language other than the predicate symbols to vary in the
second order quantification. This idea is due to Lifschitz.
To a great extent this can be reformulated so as to vary only predicates.
We replace each variable constant by a predicate, e.g.
the constant "Tweety" --> the predicate "equals-Tweety"
and the wff "A(Tweety)" --> the wff "(EXISTS x). [A(x) /\ equals-Tweety(x)]"
or perhaps the wff "(ALL x). [equals-Tweety(x) => A(x)]".
We replace each variable function by a predicate also. A hitch is that
this requires introducing new (however, safely non-variable) constants
into the language. A problem in this rewriting occurs if the function
generates an infinity of terms in the term algebra: then we have to
introduce an infinite number of new constants, perhaps not even countably
many (?). Ignoring this problem, we can for example replace the function
"denote(x)" by the predicate "DENOTE(x, X)" where "X" is a new constant
symbol. We can restrict the term algebra to be finite by restricting
composition of functions/ terms; for example, "denote" could not apply
to a denoted object, only to a name.
A PERSPECTIVE ON CIRCUMSCRIPTION
A very general way to think about all this is as the joint bounding of wffs,
either maximally or minimally. Minimizing expressions frees us also to
think in terms of maximizing: min E <-> max ~E. Having variable predicates
"opens up" context in one respect. Allowing a restriction on the inference
drawn "delimits" context in another respect. As we see above, these two
respects are significantly non-coinciding.
Perhaps the term "circumscription" which captures so well the notion of
"bounding wffs" should not be restricted to mean minimizing wffs in the
manner of [McCarthy 80] and [McCarthy 84] but rather should mean minimizing
or maximizing in a context specified in terms of which symbols in the language
are variable, as well as in terms of what is significant/ indifferent in the
sense captured by the S restriction in the partial converse.
-------
∂06-May-84 0931 RPG Lisp Conference
Joe Weening would like to go to the Lisp conference this summer.
Could we support his travel?
-rpg-
∂07-May-84 0756 PHY
∂04-May-84 1920 JMC
May 16 isn't possible for me to meet with Don. Any other day that week
is ok.
--
Unfortunately, Don can only meet on Wednesdays now (all Mon, Tues,
Thurs, and Fridays are booked for various committees). How about
the following week (Wednesday), May 23?
Unfortunately, I must be in L.A. for the next two Wednesdays. May 30
is free, however.
∂07-May-84 1208 LENAT@SU-SCORE.ARPA TI visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 May 84 12:05:50 PDT
Date: Mon 7 May 84 12:02:53-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: TI visit
To: jmc@SU-AI.ARPA
cc: lenat@SU-SCORE.ARPA
John,
COuld you please look up the date of your recent visit to TI,
whom you spoke to there? Thanks. Send it to me and/or Carolyn Tajnai.
Doug
-------
∂07-May-84 1300 DIKRAN@SU-CSLI.ARPA permission to reprint
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 7 May 84 12:59:24 PDT
Date: Mon 7 May 84 13:00:01-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
Subject: permission to reprint
To: jmc@SU-AI.ARPA
Dear Professor McCarthy,
I am writing to ask your permission to publish your
recent comments on the Katz article (addressed to
friends@SU-CSLI.ARPA and entitled "Where do Katz and
Chomsky leave AI?") in the CSLI "Newsletter," which
I am editing during Dianne Kanerva's leave. She and
I discussed this possibility in the light of our
decision to make the newsletter more of a forum.
--Dikran Karagueuzian
-------
∂07-May-84 2108 @MIT-MC:GAVAN@MIT-OZ Circumscription
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 7 May 84 21:08:40 PDT
Received: from MIT-JANIS by MIT-OZ via Chaosnet; 7 May 84 23:11-EDT
Date: Mon, 7 May 84 23:08 EDT
From: <GAVAN%MIT-OZ@MIT-MC.ARPA>
Subject: Circumscription
To: JMC@SU-AI.ARPA
Cc: GAVAN@MIT-MC.ARPA, JCMa@MIT-MC.ARPA
Hi!
We've heard a rumor to the effect that you have recently revised your
paper, "Circumscription: A Form of Non-Monotonic Reasoning". If this
is true, could you kindly send John and I each a copy? Thanks.
Our addresses:
Gavan Duffy John Mallery
160 Hancock St. 17 Upland Rd.
Cambridge, MA 02139 Cambridge, MA 02140
∂08-May-84 0838 perlis@umcp-cs.arpa Re: circumscription, CADE, invitation
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 8 May 84 08:37:53 PDT
Received: From umcp-cs.csnet by csnet-relay; 8 May 84 11:08 EDT
Date: 8 May 84 11:01:39 EDT (Tue)
From: Don Perlis <perlis@umcp-cs.arpa>
Subject: Re: circumscription, CADE, invitation
To: jmc@su-ai.arpa, grosof%sumex-aim@umcp-cs.arpa
Cc: minker@umcp-cs.arpa
Dear Ben(jamin?)-
Many thanks for your invitation. Yes, I would very much like to meet
with you and John at CADE. Since my talk is Wednesday, then there should be
no problem in our getting together Monday or Tuesday.
I am particularly eager, as is Jack, to hear what you and John have been
doing toward generalizing circumscription. (As you surmised, Jack will not
be coming, however.) I also would like to include your efforts in the
bibliography on non-monotonic reasoning that I am preparing.
Also, I would like to accept your invitation to speak at the non-monotonic
reasoning seminar at Stanford. It would be best for me, I think, if this
could be either Thursday or Friday after the conference, although earlier is
not out of the question. I will probably leave the Bay area late Friday.
Best regards,
Don
∂08-May-84 1104 DFH
To: JMC, DFH
Roy Tottingham called about a reference for Lester Earnest. His phone is
854-7472.
find malachi
∂08-May-84 1402 jbn@FORD-WDL1.ARPA Boyer-Moore prover
Received: from FORD-WDL1.ARPA by SU-AI.ARPA with TCP; 8 May 84 14:02:15 PDT
Return-Path:<>
Date: 8-May-84 13:35:08-PDT
From: jbn@FORD-WDL1.ARPA
Subject: Boyer-Moore prover
To: JMC@SU-AI.ARPA
Cc: jbn@FORD-WDL1.ARPA
I have recently converted the Boyer-Moore prover to run under UNIX on VAX
and SUN systems. The standard version of the prover available from Boyer and
Moore now incorporates the required changes, and Vaughn Pratt has plans to
bring it up on a SUN available to him. Knowing that you have been interested
in using the prover for educational purposes, its availability on lower-cost
equipment may be of value.
I would encourage the use of the prover as an educational tool. I learned
formal logic from Boyer and Moore's ``A Computational Logic'' while learning
to use the prover about five years ago, (in an application involving proofs
of security) before being introduced academically to classical logic at
Stanford (after thirteen years out of school).
I am thus one of the few people to learn the constructive approach prior to
being trained in classical mathematical logic. Coming from a strong programming
background, I found the Boyer-Moore theory very satisfying. The basics of
the Boyer-Moore system have an intutive soundness to them. I found this
soundness lacking when exposed to classical logic. Unconstrained quantifiers
seem unsafe to me; I almost view them as an aid to argument rather
than a solid formalism. There might be some dark corners lurking out there
in the space being quantified over, and I keep suspecting that some paradox
might slip in. Boyer once said to me ``Recursion is God's way.''. I didn't
appreciate this until seeing how people use quantifiers, but now I agree with
him.
After Boyer and Moore's kind of proofs, most published proofs seem very
sloppy. I tend to regard proofs that haven't been machine-checked
as about as reliable as programs that haven't been run.
Natural deduction is to me a very unnatural process; it seems like a
puzzle in which the moves have been artificially constrained to make the
problem hard. Presenting natural deduction as the ultimate in formal proofs
merely gives me the idea that natural deduction isn't the way to go. The
Boyer-Moore proofs seem to be based on more natural primitives.
John Nagle
∂09-May-84 0857 DFH
To: JMC, DFH
Please call David Thurm (212) 556 1714
∂09-May-84 1118 DFH
To: JMC, DFH
I am sorry to desert you before you have a new secretary, but my brother is
dying and the family needs me. I will be back probably on May 24-25 and
can help you again if you have not yet found a permanent secretary. Fran
∂09-May-84 1143 DFH
To: JMC, DFH
Please call Dennis Bark. 7-2216
∂09-May-84 1546 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, May 11, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 May 84 15:46:39 PDT
Date: Wed 9 May 84 15:43:09-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, May 11, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, May 11, 1984
LOCATION: Chemistry Gazebo, between Organic & Physical Chemistry
TIME: 12:05
SPEAKER: J.M. Tenenbaum
Fairchild Research Center
TOPIC: Towards Intelligent Systems:
AI Research at Fairchild/Schlumberger
ABSTRACT:
The Fairchild Laboratory for Artificial Intelligence Research (FLAIR),
founded in late 1980, undertakes basic and applied research towards
"new generation" computer-based systems that are qualitatively more
useful and easier to use than current systems. Some 30 professionals,
most of them with Ph.D. degrees, perform research on knowledge-based
signal understanding (images, speech and sensor data, etc.), visual
inspection, knowledge representation and reasoning and consultation
systems (e.g., for VLSI design and manufacture). The laboratory also
has an active program in concurrent VLSI architectures, both for
low-level signal processing and symbolic processing. The research
program and its commercial significance will be discussed.
-------
∂10-May-84 1135 YEARWOOD@SU-SCORE.ARPA Search for Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 May 84 11:35:16 PDT
Date: Thu 10 May 84 11:32:16-PDT
From: Marlene Yearwood <YEARWOOD@SU-SCORE.ARPA>
Subject: Search for Secretary
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-2266
Although we hope Fran will be returning, I am continuing a search for
the right secretary for you and Zohar. I have interviewed a few, but
so far I have not found the right one. I have a couple of more applicants
I would like to interview. Could you let me know approximately when you
will be around (in town), so that if I do find a promising applicant, I can
make arrangements for you to meet her/him. Thanks.
marlie
-------
∂11-May-84 1006 GROSOF@SUMEX-AIM.ARPA circumscription mechanization
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 May 84 10:06:14 PDT
Date: Fri 11 May 84 10:06:41-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: circumscription mechanization
To: genesereth@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA, grosof@SUMEX-AIM.ARPA
Hi Mike,
I think I have a procedure to compute the circumscription axiom for the
sorts of cases that come up in default reasoning. With some work, it
ought to be implementable in MRS. Seems it would be an excellent
programming project. I have some leads on a back-chaining proof method
for finding circumscriptive inferenmces without deriving the whole
circumscription axiom, but it's been more troublesome to get right, so far
at least. If the latter works out, it will handle your "disjunctive
answer" aspiration, I think.
For second order examples, e.g. number theory and transitive closure
examples in McCArthy '80, the procedure can detect a problem and report danger
of infinite answer when trying to write the first order circumscription
axiom. Unfortunately, it may give false alarms. I'll keep you posted.
Benjamin
-------
∂11-May-84 1013 SCHREIBER@SU-SCORE.ARPA picking up exams
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 May 84 10:12:36 PDT
Date: Fri 11 May 84 10:09:13-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: picking up exams
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-HNV.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Exam givers: You should pick up from Marilynn on Friday:
copies of the exam
blue books (take plenty)
a copy of the exam translated into Chinese for Bing Huang.
Grading: The exam giver will collect the exams at the end of the hour,
grade them, making no comments in the blue books, and give them to the
next grader. The second grader will grade the exams. The two graders
will meet and agree on a score for each student. All this must be done
by Tuesday May 22. We'll meet then and decide who passes.
Rob
-------
∂12-May-84 0955 GROSOF@SUMEX-AIM.ARPA etherington and CADE
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 May 84 09:55:27 PDT
Date: Sat 12 May 84 09:56:03-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: etherington and CADE
To: jmc@SU-AI.ARPA
cc: grosof@SUMEX-AIM.ARPA
Hi John,
Etherington is as of now planning to come down tomorrow evening so that he
can come to the conference with us. I would like to go up to the
conference tomorrow(Sunday). I have been assuming that we would all
spend Monday at the conference. Would it be possible for you to drive up
with Etherington and meet me there? Then all drive back together? That
is my tentative plan. Also, Fran was not in her office either THursday or
Friday (so far as I could tell), so if indeed Etherington is to come
tomorrow, I or you has to authorize a reservation at the hotel for
Sunday as well as Monday thru Wednesday. I didn't have any charge card
number etc. so I didn't do it yet. I will take care of it if I can
know how to arrange charging it, etc.. Please respond by net mail
before 12:20pm today (Saturday) or call me at home, ANYtime before
Sunday 10am, since I am planning to leave for the conference then.
Regards,
Benjamin
-------
∂12-May-84 0956 GROSOF@SUMEX-AIM.ARPA phone number
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 May 84 09:56:13 PDT
Date: Sat 12 May 84 09:56:50-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: phone number
To: jmc@SU-AI.ARPA
Oh, my phone number is 424-8078. I have an answering machine.
Benjamin
-------
∂12-May-84 1901 RWW sato
The person to send the acceptance to is TANAKA@UTAH-20.
The NTT persons name is Goto and he wants to come starting
September. I cannot find SATOs number but I will look somemore.
Richard
∂12-May-84 2244 DIKRAN@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 12 May 84 22:44:01 PDT
Date: Sat 12 May 84 22:44:07-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 12 May 84 12:09:00-PDT
Thank you. In a note preceding youwriting, I will mention
where it appeared first.
-------
∂12-May-84 2249 TANAKA@UTAH-20.ARPA Re: Goto
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 12 May 84 22:48:56 PDT
Date: Sat 12 May 84 23:23:20-MDT
From: JIRO TANAKA <TANAKA@UTAH-20.ARPA>
Subject: Re: Goto
To: JMC@SU-AI.ARPA
cc: TANAKA@UTAH-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 12 May 84 19:35:00-MDT
Thanks for your message. I think his name is Shigeki Goto of NTT. Yes,
NTT has Musashino Lab.. I will send your message to Goto.
Thanks, Jiro
-------
∂13-May-84 0000 GHG* Meeting with A&P committee
To: JMC@SU-AI.ARPA
CC: GHG@SU-AI.ARPA
We are expected to meet with the A&P committee between 1 and 1:15 on
Monday. Where will you be? GENE
∂13-May-84 1003 JMC*
Goad 493-0145 for demo.
∂13-May-84 2000 JMC*
Hook 327-7860
∂13-May-84 2334 HST LISP CONFERENCE
THERE'RE FUNNY THINGS GOING ON CONCERNING THIS CONFERENCE.IN SPITE OF
THE DESIRE TO PUT MY LECTURE(OR BETTER: TALK) IN THE PROCEEDINGS I
DON'T GOT ANY SPECIAL PAPER.I CAN GET NO ANSWER FROM GUY STEELE.
YOU DON'T SEEM TO BE INTERESTED IN THE PICTURES QUEST.BUT BELIEVE ME:
IT WOULD BE A QUITE IMPRESSIVE THING SUCH A COLLECTION...
ANOTHER POINT:
BILL CLANCEY HAS A LISTING OF R1 FOR ME.COULD YOU ASK YOUR SECRETARY
(I DON'T KNOW IF IT IS DIANA STILL)TO MAKE A COPY FOR ME ?
HERBERT
Guy Steele is travelling; he was here yesterday. Alas, Diana has left,
and so has my temporary secretary, so I have none for a while. I'll
try again on pictures.
∂14-May-84 0817 PHY
∂12-May-84 1205 JMC
Unfortunately, I must be in L.A. for the next two Wednesdays. May 30
is free, however.
--
Great, Wednesday, May 30, 12:15, meet at Faculty Club. Thanks. Phyllis
∂14-May-84 1044 CLT logic and parallel computation seminar
Don't forget - RPG is talking
∂14-May-84 1213 TW
To: JMC@SU-AI.ARPA, MYV@SU-AI.ARPA, barwise@SU-CSLI.ARPA,
macken@SU-CSLI.ARPA
space for vardi
25-Apr-84 1709 TW Space for Vardi
To: JMC@SU-AI.ARPA
CC: TW@SU-AI.ARPA, MYV@SU-AI.ARPA, barwise@SU-CSLI.ARPA,
briansmith@XEROX.ARPA
Moshe Vardi will be a postdoc at CSLI next year. Since space in the new
trailers is scarce, we have been asked to look for space in the
departments for the postdocs. I have already asked for other such space
for CSLI purposes, and anyway you have more clout than I do. Are you
willing to ask for a space for him, or do you already have one that will
be vacated by then? If you want more details on what he will be doing, it
is probably best to check with him directly.
Thanks --t
--------------
Has anything happened about this? Should I follow up? --t
I like Moshe Vardi, but the sign regarding space is the reverse. Namely,
CSLI has agreed to provide space for my visitor Sato. In general, I am
not available for assistance in administrative matters. When I
dismantled the AI Lab, I deliberately gave up using clout.
∂14-May-84 1317 GEORGEFF@SRI-AI.ARPA Re: support for concurrent planning workshp
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 14 May 84 13:16:55 PDT
Date: Mon 14 May 84 13:19:58-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Re: support for concurrent planning workshp
To: JMC@SU-AI.ARPA
cc: georgeff@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 14 May 84 12:20:00-PDT
That's great news. Thanks a lot for the assistance.
We have almost definitely decided on August 22-24, unless someone complains
very loudly and then we may try and arrange some other time. This time
was previously OK with you (non-monotonically reasoned) --- let me know
if there is any problem with this date.
Also, some people have expressed a desire to get away from Stanford (say,
to a conference place in Monterey) so that the participants will have
plenty of opportunity for informal discussion. This has advantages and
disadvantages --- how do you feel about the idea?
Thanks again for the funding.
Mike.
-------
∂14-May-84 1332 SCHREIBER@SU-SCORE.ARPA [Richard Anderson <ANDERSON@SU-SCORE.ARPA>: programming projects]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 May 84 13:32:30 PDT
Date: Mon 14 May 84 13:28:49-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: [Richard Anderson <ANDERSON@SU-SCORE.ARPA>: programming projects]
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-DIABLO.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Any volunteers? Any ideas?
---------------
Mail-From: ANDERSON created at 14-May-84 12:49:59
Date: Mon 14 May 84 12:49:59-PDT
From: Richard Anderson <ANDERSON@SU-SCORE.ARPA>
Subject: programming projects
To: jvc@SU-SCORE.ARPA, schreIBER@SU-SCORE.ARPA, mccall@SU-SCORE.ARPA
Does anybody want to grade a project, or do you know any one who does?
I haven't had any luck in recruiting any volunteers and projects
are starting to accumulate.
Todays selection is:
MS project
A graphics interface project written in C
MS project
A heuristic symbolic integration project, it seems to have to
parts, one to do the integration, and the second which is to
serve as a tutor to students attempting to learn how to
integrate. It is of course written in LISP
Phd Project
A program to test for satisfiability in extended temporal
logic. This looks like a very nice project. It is
80 pages of prolog.
Richard
-------
-------
∂14-May-84 1904 TANAKA@UTAH-20.ARPA Re: Goto
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 14 May 84 19:04:49 PDT
Date: Mon 14 May 84 20:05:12-MDT
From: JIRO TANAKA <TANAKA@UTAH-20.ARPA>
Subject: Re: Goto
To: JMC@SU-AI.ARPA
cc: TANAKA@UTAH-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 12 May 84 19:35:00-MDT
I have transmit your message to Dr. Goto and Dr. Sato. The following is
the reply message from Dr. Sato.
Dear Professor McCarthy:
Thank you for accepting Mr.Goto's visit to Stanford. Please send my best
regards to Dr.Weyhrauch. Also thank you for your letter and your kind
invitation. I am planning to stay at Stanford for about five months starting
from this July.
I am looking forward to seeing you at Stanford.
Masahiko Sato
I was also asked from Mr.Goto to tell you his current address:
His address is:
Shigeki Goto
Research Div. Musashino Electrical Communication Lab.
3-9-11, Midori-cho, Musashino-shi, Tokyo 180, Japan
-------
∂15-May-84 0131 HST lisp history
when do you believe did you write the first version of the advice-taker
paper?i found a copy at your home dated 27 no 24. of july 1958.
do you rember a call for papers?was the paper invited?
do you believe this version of summer was the final version?
∂15-May-84 0900 JMC*
toby m. 856-7900
∂15-May-84 0900 JMC*
plane reservation
∂15-May-84 0900 JMC*
blasgen 3478
∂15-May-84 0900 JMC*
elliott re hook, faculty club reserv., remark about present
∂15-May-84 0900 JMC*
ask for air ticket to france
∂15-May-84 0917 vardi@Diablo Re:Space for Vardi
Received: from SU-DIABLO.ARPA by SU-AI.ARPA with TCP; 15 May 84 09:17:40 PDT
Date: Tue, 15 May 84 09:18 PDT
From: Moshe Vardi <vardi@Diablo>
Subject: Re:Space for Vardi
To: JMC@Sail, MYV@Sail, TW@Sail, barwise@SU-CSLI.ARPA, macken@SU-CSLI.ARPA
I haven't heard of any development.
Moshe
∂15-May-84 0921 KRANE.YKTVMX%ibm-sj.csnet@csnet-relay.arpa ArpaNet Communications
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 15 May 84 09:21:41 PDT
Received: From ibm-sj.csnet by csnet-relay; 15 May 84 12:08 EDT
Date: 15 May 1984 09:38:50-EDT (Tuesday)
From: Steve Krane <KRANE.YKTVMX%ibm-sj.csnet@csnet-relay.arpa>
To: jmc@su-ai.arpa
Subject: ArpaNet Communications
This is try number 1. Your last attempt ("krane.yktvmx.ibm") worked.
I hope this gets through.
RSVP,
Steve
"krane.yktvmx.ibm"@csnet-relay
communication established
Yours got through also.
∂15-May-84 0959 SCHREIBER@SU-SCORE.ARPA [Dageforde.pa@XEROX.ARPA: Prefix Predicate Calculus ok on Comp?]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 May 84 09:59:11 PDT
Date: Tue 15 May 84 09:56:07-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: [Dageforde.pa@XEROX.ARPA: Prefix Predicate Calculus ok on Comp?]
To: lamping@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, abadi@SU-SCORE.ARPA,
jmc@SU-AI.ARPA
Please answer this for me. Rob
---------------
Return-Path: <Dageforde.pa@Xerox.ARPA>
Received: from Xerox.ARPA by SU-SCORE.ARPA with TCP; Mon 14 May 84 16:45:36-PDT
Received: from Riesling.ms by ArpaGateway.ms ; 14 MAY 84 16:29:06 PDT
Date: 14 May 84 16:24:02 PDT (Monday)
From: Dageforde.pa@XEROX.ARPA
Subject: Prefix Predicate Calculus ok on Comp?
To: Schreiber@SU-SCORE.ARPA
cc: Dageforde.pa@XEROX.ARPA
I will be taking the Comp. my first time next weekend, and I am
wondering:
When a question (e.g., an AI question) asks us to write something "in
predicate calculus" or to prove something by resolution, can we use the
Prefix Predicate Calculus (using the words "IF", "ALL", "EXIST", etc.
with propositions like (Person x), not Person(x)) we were taught in
CS223 this last quarter, or are we required to use the form given in
some logic books, with upside-down A's for "for all", etc.?
Please call me at 326-8304 or (408)257-4213 to tell me the answer.
Thanks!
Mary
-------
∂15-May-84 1457 GOTELLI@SU-SCORE.ARPA NY Times News Service
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 May 84 14:57:01 PDT
Date: Tue 15 May 84 14:40:18-PDT
From: Lynn Gotelli <GOTELLI@SU-SCORE.ARPA>
Subject: NY Times News Service
To: JMC@SU-AI.ARPA
cc: gotelli@SU-SCORE.ARPA, bosack@SU-SCORE.ARPA
John, May I please have a copy of the letter you received
from the New York Times cancelling the news service. I will
be happy to make the xerox copy if you leave the original
in my mailbox on the second floor.
Thank you,
Lynn Gotelli
-------
∂15-May-84 1501 RINDFLEISCH@SUMEX-AIM.ARPA Doug Smith Visit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 May 84 15:00:52 PDT
Date: Tue 15 May 84 15:01:03-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Doug Smith Visit
To: HPP-Exec@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, EEngelmore@SUMEX-AIM.ARPA
Doug Smith, head of the ONR Information Science Division, will be out here
on May 29 and would like to talk to people in the HPP and FR groups to find
out what research is going on and to talk about additional funding
possibilities from ONR. I'd like to have a session with Smith early on the
29th for BGB and me to give him an HPP overview (are you available Bruce?)
and he has a meeting with Doug Lenat at 1:30. He probably wants to meet
with MRG and EHS about the Introspective Systems work. If others would like
to meet with Smith, please make arrangements with Ellie Engelmore who will
be coordinating the schedule.
Tom R.
-------
∂15-May-84 1520 STEINBERG@RUTGERS.ARPA Proposed seminar for AAAI sponsorship
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 15 May 84 15:20:10 PDT
Date: 15 May 84 18:19:59 EDT
From: Louis Steinberg <STEINBERG@RUTGERS.ARPA>
Subject: Proposed seminar for AAAI sponsorship
To: jmc@SU-AI.ARPA
cc: steinberg@RUTGERS.ARPA
I am organizing a workshop on Knowledge-based Design to be held here
at Rutgers this July. It has been suggested that it would be nice to
get the AAAI to be a sponsor, along with Rutgers. This AAAI sponsorship
would not involve any financial involvement, simply a "seal of approval".
How would one go about applying for such sponsorship? Is it feasible at
this late date?
A draft of the anouncement flyer follows. People who've been helping with the
planning include Dave Barstow and Jack Mostow.
Thank you for your help.
**** DRAFT **** DRAFT **** DRAFT ****
RUTGERS
the state university
of new jersey
DEPARTMENT OF COMPUTER SCIENCE ≥ HILL CENTER FOR THE MATHEMATICAL SCIENCES
BUSCH CAMPUS ≥ NEW BRUNSWICK ≥ NEW JERSEY 08903 ≥ (201) 932-3581
Louis I. Steinberg
Assistant Professor
13 May 1984
Dear Colleague,
I am pleased to invite you to "The Rutgers Workshop on Knowledge Based Design
Aids: Models of the Design Process", to be held this July 9 and 10.
As you know, computer aids for the design of hardware and software are
attracting a huge amount of interest, and a number of researchers are taking a
Knowledge Based approach to building such systems. This summer seems to be a
very good time to get a group of us together in a small, informal workshop.
The purpose of the workshop is to meet each other, to find out who is working
on what, and to exchange ideas. It should be a lot of fun.
In order to provide a focus for our discussions, we have chosen the theme,
"Models of the Design Process". Most design aids embody, either implicitly or
explicitly, some model of the process by which a design is created. We hope
that focusing on these models will make it easier to see what our underlying
assumptions are and how our specific research activities are related to each
other.
In order to keep the atmosphere informal and the level of interaction high, we
will limit attendance to about 30 people, and attendance will be by invitation
only. I very much hope that you can join us. Since time is so short, we ask
that you
please let us know as soon as possible whether or not you can come.
See the other side for details. The other sheet of this mailing is a response
form, ready to be filled out, refolded, and mailed. It's even stamped. Please
return it by May 31 at the latest. Thank you.
I am looking forward to seeing you at the workshop.
Sincerely,
Louis Steinberg
Workshop Chairman
! 2
Details
Time and Place
The workshop will be held Monday and Tuesday, July 9 and 10, 1984, at the Hyatt
Hotel, [* address *], New Brunswick, New Jersey. The hotel is about a 45
minute drive from Newark Airport, and about two blocks from the New Brunswick
train station. Directions are available on request.
Program
There will be a reception and registration Sunday night, July 8, from 7 - 9:30
PM. The technical program will start around 9 AM Monday and end around 4 PM
Tuesday. It will consist primarily of talks by the attendees, with plenty of
free time for informal discussions. If there is interest we may also have some
panels and/or discussion groups.
Talks should be roughly 20 minutes in length, and based on ongoing or recently
completed research on knowledge based approaches to design aids for circuits or
programs. Speakers should be sure to describe their model of the design
process. Please note that there will not be time for everyone to give a formal
talk.
Cost
The registration fee will be $?? [* ?? *]. This covers a hotel room (single)
for Sunday and Monday nights, a coffee and Danish breakfast [* ?? *] and lunch
Monday and Tuesday, and a barbeque dinner Monday night, as well as workshop
attendance. A number of double rooms are also available, at a registration fee
of $?? [* ?? *] per person.
Proceedings
In keeping with the informal nature of the workshop, no proceedings will be
published. However, each attendee is invited to submit a one page summary of
their work and interests for distribution at the workshop. These summaries
should be submitted in camera ready form by July 1. Be sure to include your
name, address, network address, and phone.
For Further Information
For further information, contact:
Louis Steinberg Steinberg@Rutgers (201) 932-3581 or
Priscilla Rasmussen Rasmussen@Rutgers (201) 932-2768
both at Department of Computer Science
Hill Center, Busch Campus
Rutgers University
New Brunswick, NJ 08904
! 3
The Rutgers Workshop on Knowledge Based Design Aids:
Models of the Design Process
Please complete and return this form whether or not you will be attending.
Please return it as soon as possible, and by May 31 at the latest. Thank you.
Name: ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
I [] will [] will not attend.
I would like a [] single room
[] double room, shared with ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Dietetic restrictions:
[] Kosher [] Low Sodium [] Vegetarian [] Other ←←←←←←←←←←←←←←←
I [] really want to give a talk, titled ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
[] would be willing to give a talk titled ←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
but would not be upset if there is not sufficient time.
[] would rather not give a formal talk
I [] would [] would not like to demonstrate a running system.
Tentative plans call for a Xerox Dandelion to be available as well
as a terminal with a modem and a way to get to the Arpa-net. Please
indicate what other facilities you would need:
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Suggestions for panels, discussion groups, or other additions to the program
(please suggest people for the panels as well as topics)
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
Names and addresss of other people who should be invited if space permits:
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←←
-------
∂15-May-84 1600 JMC*
cleaning
∂15-May-84 1749 SHORTLIFFE@SUMEX-AIM.ARPA Re: Chandrasekharan workshop
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 May 84 17:49:34 PDT
Date: Tue 15 May 84 17:13:25-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Chandrasekharan workshop
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 15 May 84 14:02:00-PDT
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
John,
The AIM Workshops have been of particular value to graduate students
in the past, and I would support any help the AAAI might give to providing
further participation by graduate students at this year''s event. It seems
like an ideal use of whatever AAAI conference funds might be available to
support activities of this kind.
Regards,
Ted
-------
∂16-May-84 0749 SIMONDS@CMU-CS-C.ARPA
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 16 May 84 07:49:52 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Wed 16 May 84 10:49:46-EDT
Date: Wed 16 May 84 10:49:44-EDT
From: SIMONDS@CMU-CS-C.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 14 May 84 22:40:00-EDT
John,
Look forward to seeing you herr June 25-29. Reservations have been
made for those dates. I think things are going quite well for the
Centre; we seem to be perceived as serious now, both by the
government agencies and the research world. Now to deliver both
actions and good research....
-- Todd
-------
∂16-May-84 0852 SIMONDS@CMU-CS-C.ARPA
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 16 May 84 08:51:57 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Wed 16 May 84 11:48:15-EDT
Date: Wed 16 May 84 11:48:14-EDT
From: SIMONDS@CMU-CS-C.ARPA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 14 May 84 22:40:00-EDT
John,
In case my previous message wa in error, be assured that the reservations
are for June 24 - 29.
-- Todd
-------
∂16-May-84 0852 PSZ@MIT-MC AAAI support for AIM Workshop
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 16 May 84 08:52:31 PDT
Date: 16 May 1984 11:52-EDT
From: Peter Szolovits <PSZ @ MIT-MC>
Subject: AAAI support for AIM Workshop
To: JMC @ SU-AI
cc: PSZ @ MIT-MC, Shortliffe @ SUMEX-AIM, Chandrasekaran @ RUTGERS
John,
I favor Chandra's request for $5K from AAAI to help out with
this summer's AI/Medicine workshop. He would use the money mainly to
support attendance by graduate students in the field, which is probably
the most useful way to spend workshop money. I have always thought in
previous years that the workshops have been most valuable for getting
grad students "up to speed" in this research area, for letting them get
to know each other and each others' research approaches, and for
directing the workshop into a real exploratory rather than
formal-presentation mode.
As you probably know, there have been AIM workshops for a
decade, supported with varying degrees of generosity by NIH through the
SUMEX grant. This year because of some internal changes at NIH, the
workshop money did not get approved, and this community faces the
prospect of at best a very small meeting of the more senior people, with
little money to bring students. I think that medical AI is an important
issue for many AAAI members (nearly a quarter of AAAI members sign up
for the AAAI-M subgroup that I represent as the liaison), and AAAI
support for this workshop would be quite appropriate.
Please feel free to call if you would like to talk this over
some more -- (617) 253-3476.
Thank you. --Pete Szolovits
∂16-May-84 0922 PAT@SU-CSLI.ARPA Lunch Meetings with Jon Barwise
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 16 May 84 09:21:59 PDT
Date: Wed 16 May 84 09:21:57-PDT
From: Pat Wunderman <PAT@SU-CSLI.ARPA>
Subject: Lunch Meetings with Jon Barwise
To: JMC@SU-AI.ARPA
cc: Pat@SU-CSLI.ARPA
Prof. McCarthy,
Jon has asked me to set up a series of lunchtime meetings at the
Faculty Club with the original "principals" (or "founding fathers")
of CSLI, so that he can get your feedback prior to our 1st year
review with SDF. He would like to meet with small groups of the
original members, plus Betsy Macken, our Ass't Director, and poss-
ibly Susan Stucky of SRI, who has taken over the task of coordinating
the Review. Would you be willing/able to meet with Jon & 2 or 3
others as 12:00 on any of these dates:
THURS, 5/17 MON, 5/21 TUES, 5/22 WED, 5/23
Would you either call me (Pat Wunderman) at 7-1131 , or send a
netmessage to me (Pat@Turing) to let me know your 1st/2nd choice
preferences, if any? Thank you.
--Pat W.
-------
∂16-May-84 1134 ME DD channels 30-37
To: JMC, RPG
∂15-May-84 1901 JMC DD35?
Channel 35 tty106 has just gone bad, e.g. an l is doubled.
∂16-May-84 0941 RPG DD's
channels 30 and up are very fuzzy today.
-rpg-
ME - Turns out that in disconnecting the Robotics PDP-11/45, they also
disconnected the inputs to the video synthesizer, which inputs came
precisely from DD 30-37. Disconnecting them left them unterminated,
causing the ghosting seen on those channels. They're all fixed now.
∂16-May-84 1220 GROSOF@SUMEX-AIM.ARPA Re: paper for Etherington
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 May 84 12:20:33 PDT
Date: Wed 16 May 84 12:05:00-PDT
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: Re: paper for Etherington
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 16 May 84 07:25:00-PDT
I'll try
Benjamin
-------
∂16-May-84 1325 SCHREIBER@SU-SCORE.ARPA Bing Huangs comp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 84 13:25:16 PDT
Date: Wed 16 May 84 13:22:00-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Bing Huangs comp
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-DIABLO.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
There is a student, Bing Huang, who will be taking the comp in a partially
translated (to Chinese) form. All the proctors must pick up
his exam from Marilynn this week.
Please explain to Bing that he should try to answer in English, using it
as much as possible. But if there is a concept he cannot express in
English, he may use Chinese characters.
Then, early on Monday morning, bring his answers to Andy Yao, who will
translate them into English. We can then grade them.
Reminder. Meeting next week at 12:15 Tuesday to set the passing grades.
Rob
-------
∂16-May-84 1331 YEARWOOD@SU-SCORE.ARPA Secretary Position
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 84 13:31:13 PDT
Date: Wed 16 May 84 13:28:11-PDT
From: Marlene Yearwood <YEARWOOD@SU-SCORE.ARPA>
Subject: Secretary Position
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-2266
Are you going to be around the first part of next week, so that I might
schedule some interviews? If you, are please indicate some times that I
could make appointments as necessary.
Thanks.
marlie
-------
∂16-May-84 1342 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 May 84 13:42:23 PDT
Date: Wed 16 May 84 13:38:49-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT
To: siglunch@SUMEX-AIM.ARPA
There WILL be a Siglunch, this Friday, May 18, l984. Jim Brinkley,
Stanford University, will give the presentation. Title and abstract will
follow.
-------
∂16-May-84 1412 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, May 18, l984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 May 84 14:06:17 PDT
Date: Wed 16 May 84 14:01:31-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, May 18, l984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, May 18, 1984
LOCATION: Chemistry Gazebo, between Organic & Physical Chemistry
TIME: 12:05
SPEAKER: Jim Brinkley
Stanford University
TOPIC: Ultrasonic Three-Dimensional Organ Modelling
ABSTRACT:
(Note, this is basically a repeat of my thesis orals, with
some addtional comments on future research possibiliites)
This work describes the evolution and evaluation of a computer system
for building accurate three-dimensional organ reconstructions for size
and shape measurements. A series of arbitrarily-oriented real-time
ultrasound scans are acquired throughout an organ of interest. The
organ borders on each scan are outlined with a light pen; the scans
are related to each other in three dimensions by a custom-built
position locator. The positions and outlines are combined to produce
a reconstruction of the organ as a collection of arbitrary 3D surface
points.
In the first implementation a volume model is fitted to the
reconstruction by a "data-driven" system which has no knowledge of the
organ being imaged. The average accuracy of volume determination
assessed on balloons, kidneys and left ventricular molds was 5
percent. Volumes found by head and trunk reconstructions on 41 live
term fetuses showed approximately a 30 percent improvement in fetal
weight prediction over current methods.
In a later implementation an artificial intelligence
"knowledge-driven" system uses learned shape knowledge to analyze the
3D ultrasound data. Example analyses on round and long-thin balloons
show that the knowledge-driven approach allows accurate volumes to be
obtained with only one third the available data. It allows shape
knowledge to be substituted for areas of missing data, and it
demonstrates the feasibility of high-level guidance for low-level
border detection. Potential scenarios are discussed for the use of a
knowledge-driven system in 3D medical image analysis, including the
analysis of images produced by other imaging modalities such as
computerized tomography or nuclear magnetic resonance.
-------
∂16-May-84 1440 JJW Summer
I will be leaving on June 3, for my summer job with IDA in Princeton.
While there, I'd like to remain in communication, so is it all right
with you if I take along my home terminal and modem? Len Bosack is
working on finding out the number of a Milnet TAC in New Jersey for me
to use to get to the net.
∂16-May-84 1640 YEARWOOD@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 84 16:40:09 PDT
Date: Wed 16 May 84 16:37:15-PDT
From: Marlene Yearwood <YEARWOOD@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 16 May 84 16:38:00-PDT
Stanford-Phone: (415) 497-2266
I will do that. I am not sure there will be good enough applicants for
you to meet, but if there are, it is easier if I know your schedule.
Thanks.
marlie
-------
∂16-May-84 1654 JJW Terminal
∂16-May-84 1644 JMC
As a rule, TACs don't allow 1200/150, and anyway I think I want to
keep the terminal for one of the summer people, e.g. Bellin or Mason.
So unless they appear by then and don't want it, I'd prefer you
brought it in.
JJW - OK, I'll leave the terminal here. The modem is single-speed
1200 baud (or 300 baud), though; not 1200/150.
∂16-May-84 1700 AMSLER@SRI-AI.ARPA Re: end of New York Times news service
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 May 84 16:59:06 PDT
Date: Wed 16 May 84 17:02:01-PDT
From: Robert Amsler <AMSLER@SRI-AI.ARPA>
Subject: Re: end of New York Times news service
To: JMC@SU-AI.ARPA
cc: AMSLER@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 15 May 84 11:45:00-PDT
I'm very sorry to hear of the loss of NYTimes access. I
obtained access for SRI-AI a little over a year ago to have
a source of text for my natural language text research, and
our account continues to this date. It may be possible for
you to get access to it over here (of course, under the
restriction that it not be redistributed to net bboards or
otherwise publically posted.) We run a version of NS
reworked by Bill Westfield. It does support notification
profiles, but not mail. I believe Bill rewrote much of the
code.
If you have an SRI-AI account, just try typing NS and see what
happens. I can really understand how the loss could feel after
having gotten used to browsing the Times for news myself.
Bob Amsler
-------
∂16-May-84 2207 MA
∂16-May-84 1641 JMC
To: ZM
CC: MA
We are supposed to examine Martin Abadi tomorrow, but I don't have
a time. I need to keep the afternoon free, so I suggest 10am, my office
or yours.
---
I am afraid there has been some misunderstanding! Some ten days ago, after an
illness, Zohar and I agreed that it may be better to postpone my quals for a
few weeks. I sent you a message at that time. I just got back from the CADE;
sorry not to have reminded you about this sooner. In short, I was not expecting
to take quals tomorrow; I plan to be ready shortly after Zohar returns from
Israel, in June. We could wait some more before rescheduling this oh-so-often
rescheduled exam. Thanks (and, once more, apologies).
Martin
Sorry! I even replied to your message, agreeing, but forgot to remove
the date from my calendar. Let us know when you are ready.
∂16-May-84 2359 JMC*
Call bank about raising visa limit.
∂17-May-84 0821 ELYSE@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 84 08:21:24 PDT
Date: Thu 17 May 84 08:17:53-PDT
From: Elyse J. Krupnick <ELYSE@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 16 May 84 18:30:00-PDT
Will do.
Elyse
-------
∂17-May-84 0930 WALTON@SU-SCORE.ARPA Your hours
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 84 09:30:35 PDT
Date: Thu 17 May 84 09:15:43-PDT
From: Melba Walton <WALTON@SU-SCORE.ARPA>
Subject: Your hours
To: jmc@SU-AI.ARPA
cc: walton@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
Because there is no secretary and because Zohar Manna will be out of
the department for several days - I would like to know when you can
reached if people call in for AI information.
thank you,
Melba
receptionist
-------
Basically, I'm not available for random requests for AI information.
Please take a message and tell them I'll call them back if I think I
can help. Also I prefer computer mail about phone messages to the
little blue slips.
∂17-May-84 0931 STAN@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: my computer account at sri-ai]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 May 84 09:31:33 PDT
Date: Thu 17 May 84 09:34:16-PDT
From: STAN@SRI-AI.ARPA
Subject: [John McCarthy <JMC@SU-AI.ARPA>: my computer account at sri-ai]
To: tyson@SRI-AI.ARPA
cc: jmc@SU-AI.ARPA
Can you handle this?
---------------
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by SRI-AI.ARPA with TCP; Wed 16 May 84 17:41:16-PDT
Date: 16 May 84 1736 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: my computer account at sri-ai
To: stan@SRI-AI.ARPA
When I try to login it complains I have the wrong password.
Whom should I ask to reset my password?
-------
∂17-May-84 0932 PAT@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 May 84 09:31:58 PDT
Date: Thu 17 May 84 09:31:20-PDT
From: Pat Wunderman <PAT@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
cc: PAT@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 16 May 84 16:33:00-PDT
Thanks for replying so promptly. It looks like TUES, 5/22 is good for
Jon, too. I'll send you a reminder on Mon & tell you who else will be
joining you. Would you prefer to meet there, at the FacClub?
--Pat Wunderman
-------
∂17-May-84 1013 WALTON@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 84 10:12:15 PDT
Date: Thu 17 May 84 10:05:32-PDT
From: Melba Walton <WALTON@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 17 May 84 09:57:00-PDT
Stanford-Phone: (415) 497-2273
Thanks for the info re: random AI requests.
I also prefer mm to blue however it is usually to slow for such a busy
switchboard - any ideas how to "lookup" and send quicker would be a
bonanza for the receptionist.
Melba
-------
∂17-May-84 1017 ZAUDERER@SU-SCORE.ARPA typewriter
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 84 10:17:35 PDT
Date: Thu 17 May 84 10:10:12-PDT
From: Shanee Zauderer <ZAUDERER@SU-SCORE.ARPA>
Subject: typewriter
To: JMC@SU-AI.ARPA
Stanford-Phone: (415) 497-3125
Dr. McCarthy I'm very sorry I caused you some anxiety and inconvenience
the other day when I arranged with Marlie to borrow your office typewriter
for a visitor (Chris Paige) and didn't leave a note to indicate where it
had gone. Because the IBM type balls don't fit it that he needs to use
I have exchanged it with mine so now I have it and at anytime that you
need it let me know and I will return it to you. Thanks for your
patience, Shanee
-------
∂17-May-84 1218 TYSON@SRI-AI.ARPA Computer account on SRI-AI
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 May 84 12:17:53 PDT
Date: Thu 17 May 84 12:20:51-PDT
From: Mabry Tyson <Tyson@SRI-AI.ARPA>
Subject: Computer account on SRI-AI
To: jmc@SU-AI.ARPA
In response to your message, I have set your password to COMMONSENSE.
FYI, Paul Martin (PMARTIN) and I have privileges on SRI-AI so we can help
you if something like this comes up again.
Mabry Tyson
-------
∂17-May-84 1438 JMC
Hyatt SanJose 408 298-0300 649
∂18-May-84 0900 JMC*
Pushkin to UGLY.
∂18-May-84 1423 PAT@SU-CSLI.ARPA Lunch Meeting at Faculty Club
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 May 84 14:23:13 PDT
Date: Fri 18 May 84 14:22:45-PDT
From: Pat Wunderman <PAT@SU-CSLI.ARPA>
Subject: Lunch Meeting at Faculty Club
To: BMoore@SRI-AI.ARPA, JMC@SU-AI.ARPA, Lauri@SRI-AI.ARPA
cc: Barwise@SU-CSLI.ARPA, Betsy@SU-CSLI.ARPA, Stucky@SU-CSLI.ARPA,
Pat@SU-CSLI.ARPA
This is to confirm that you all have a lunchtime meeting at 12:00 on
TUESDAY, 5/22 at the Faculty Club. The people from Ventura will walk
over at 11:45, so you may join them at Ventura or at the FacClub.
--Pat W. (7-1131)
-------
∂18-May-84 1654 TAJNAI@SU-SCORE.ARPA Re: telephone number
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 May 84 16:51:48 PDT
Date: Fri 18 May 84 16:38:53-PDT
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Re: telephone number
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 18 May 84 11:22:00-PDT
John, I'm sorry to be so late in responding. The port switcher has
been down since this morning; I just got on-line.
The number I have for GTE Labs in Waltham is
617/890-8460.
Carolyn
-------
∂18-May-84 2229 HST travel to lisp-conference
the cheapest way to go to austin is via boston plus a round-way ticket.
therefore i could come to stanford at the end of july.
i could give my history talk (intended for austin.)
are you interested?could you host me?
∂19-May-84 0849 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 May 84 08:49:31 PDT
Date: Sat 19 May 84 08:46:40-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 18 May 84 19:44:00-PDT
I don't understand the meaning of this.
GENE
-------
∂19-May-84 1110 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 May 84 11:10:12 PDT
Date: Sat 19 May 84 11:07:19-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 19 May 84 08:51:00-PDT
I'm worried that your response will be misinterpreted.
Several of us would be quite upset if the whole business of Traub would
be re-opened.
GENE
-------
∂19-May-84 1240 JK the new decision procedure
To: JMC, LEP, JJW
has been installed. It still has some debugging stuff on it and
its treatment of equalities is not very graceful. However, it
seems to work. I will soon arrange it to know about SIMPINFO.
It is very strict about multiple uses of the same fact. If some
fact is needed twice, then it needs to be cited that many times.
∂19-May-84 1244 JK decision procedure
To: JMC, LEP
Bug reports welcome.
∂19-May-84 1246 JK
∂19-May-84 1244 JMC new decision procedure
Are the features yet to come required for it to do the examples done
by the old decision procedure?
------
It has all the features intended; I might add something on splitting
conjunctions.
∂20-May-84 1101 JK
∂20-May-84 1022 JMC new derive
bird.lsp[s84,jmc] contains my bird circumscription proof. Step 13 is its
first use of derive, and it runs 15 minutes without output. It ran about
a minute before.
------------
I think I know what the problem is:
The new derive also takes into account implicit universal
variables in lines cited : for example in 10, 12 bird, ostrich are regarded
as unifiable, and in fact high-order unifiable.
They will unify against practically anything.
I'll see what I can do to fix this.
∂20-May-84 1820 LEP Planning proof
I finally finished it -- it required a lot of redundant case proofs. The pretty
version of it is in do.ppr[1,lep]. There are some axioms embedded in the
proof that I should move to the top, but the rest is done in fairly logical order.
∂20-May-84 1829 JMC
Kathy Faes 7-3687
∂20-May-84 2106 JK new derive
To: LEP, JMC
The problems you have reported have been fixed.
∂20-May-84 2120 JK
Derive still does not like equivalences very much
What you really want to do is to open a definition, so try the following:
16. (der |∀x.¬ab2 aspect1 x ⊃ ¬flies2 x| () (open ab2 flies2))
17. (der |∀x.bird x ⊃ ab2 aspect1 x| () (open ab2))
18. (der |∀x.bird x ∧ ¬ab2 aspect2 x ⊃ flies2 x| () (open ab2 flies2))
19. (der |∀x.ostrich x ⊃ ab2 aspect2 x| () (open ab2))
∂21-May-84 1012 LAMPING@SU-SCORE.ARPA Comp Grading
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 May 84 10:12:36 PDT
Date: Mon 21 May 84 10:08:14-PDT
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Comp Grading
To: JMC@SU-AI.ARPA
I have the bluebooks. If you send me mail when you get in, I
will bring them over to you.
-------
∂21-May-84 1024 JK
∂20-May-84 2211 JMC
new derive is slow propositionally
bird.lsp now takes approximately 43 seconds, 25 of which is spent on
step 21 which is just the derivation of a conjunction of 5 terms
from the conjuncts. This suggests either some further
improvements in derive or the introduction of pderive specialized
to purely propositional derivations.
--------------
The code is currently completely untuned for debugging reasons:
For example, it does a complete search for all valid paths.
I will be tuning it this week.
∂21-May-84 1420 CHANDRASEKARAN@RUTGERS.ARPA AAAI support for the Workshop
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 21 May 84 14:20:07 PDT
Date: 21 May 84 17:19:52 EDT
From: Chandra-at-OhioState <Chandrasekaran@RUTGERS.ARPA>
Subject: AAAI support for the Workshop
To: JMC@SU-AI.ARPA
I am sorry to bother you, but I was wondering if you
have been able to make the decision re. our request for
$5K funding from AAAI for the AIM Workshop. This information
will help people from bothe Stanford and MIT and other places
to decide how many of their people they can afford to send.
-------
∂21-May-84 1924 krovetz@nlm-mcs CMI project
Received: from NLM-MCS.ARPA by SU-AI.ARPA with TCP; 21 May 84 19:24:17 PDT
Received: by nlm-mcs.ARPA (4.22/4.7)
id AA03430; Mon, 21 May 84 22:25:53 edt
Date: Mon, 21 May 84 22:25:53 edt
From: krovetz@nlm-mcs (Bob Krovetz)
Message-Id: <8405220225.AA03430@nlm-mcs.ARPA>
To: jmc@su-ai
Subject: CMI project
Professor McCarthy,
I'm an AI researcher at the National Library of Medicine. I saw
a brief mention in the latest issue of Abacus about a project you're
doing with the Centre Mondial Informatique regarding electronic libraries.
Can you give me any more information about your project?
Thank you,
Bob Krovetz
The project is to make an electronic public library. It will begin with
a VAX, phone lines, and French literature without formulas or pictures
that is in the public domain. What's Abacus?
∂21-May-84 2238 JJW Thesis proposal
To: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, ullman.israel@CSNET-RELAY.ARPA
I have put together a summary of the topics that I would like to deal with
in my thesis. Please look this over; I am eager to hear your comments.
Based on this, I hope you are all willing to sign my G81 form.
Joe
[A note on the text below: after writing this, it seems to me to be somewhat
verbose and perhaps states the obvious in many places. But I feel that it
does touch on the areas that I find interesting, and this is its purpose.]
----------------------------------------------------------------------------
Parallel Execution of Lisp Programs
Most studies of program parallelism have dealt either with ordinary
"sequential" languages (e.g. Fortran or Algol-like languages), or with
languages that contain explicit constructs for specifying parallelism
or are based on a parallel model of execution (dataflow languages or
functional languages as proposed by Backus).
This thesis will study Lisp, which is somewhere in between these classes.
Lisp includes both functional and sequential constructs. Its basic data
structures are of a "scalar" nature; however by abstracting a Lisp program
one may consider many operations to take place on higher-level objects and
often in parallel on the elements of these structures.
The main goal will be to execute Lisp programs taking advantage of
parallelism, by
(1) analysis of programs to detect potential parallelism, both low-level
and high-level,
(2) considering various restrictions to the Lisp language that
facilitate such analysis, or extensions to the language that
increase the amount of parallelism possible,
(3) determining characteristics of parallel architectures that are
appropriate for execution of Lisp programs.
The basic model
The basic model that we assume is that of a multiprocessor with either
shared memory, private memories, or a combination (the effects of these
are one of the things to be studied), which will execute Lisp programs
after they are processed by a compiler. Although an interpreter is a
basic part of all Lisp systems, it is fairly clear that someone wanting
fast program execution will be willing to use a compiler.
The way in which computation is done in parallel is through the creation
of "tasks", which are pieces of code started by other tasks, and which run
on an idle processor if one is available, or else are put in a queue of
tasks waiting to run. The management of this queue (or perhaps there are
several queues) is an important part of the whole process. Some amount of
cost is associated to the overhead of creating new tasks and managing the
queues.
Some method of synchronization will be provided for task communication and
interlocked access to shared resources.
Analysis of Lisp programs
Program analysis may be divided into "low-level" and "high-level"
detections of parallelism. The low level decides which operations may be
performed in parallel because they do not depend on each other's results
or require exclusive access to a resource. The term "operation" refers to
something at the level of the implementation of a program; i.e., after the
data structures have already been decided. High level analysis is given
the freedom to implement Lisp constructs in a way most suitable to the
parallel execution of a particular program.
After determining what parallelism is possible, the cost of creating
separate tasks for parallel execution must be considered. For the lowest
level of operations, namely primitives of the language or pieces of code
without function calls, it is often straightforward to compute or estimate
the sequential and parallel running times and make a decision. Since the
program will run on a fixed number of processors, it may be advantageous
to defer some of these decisions until runtime, because creating extra
tasks when there are no processors to run them is counterproductive.
When the program performs operations whose execution time a compiler
cannot readily predict, we may adopt a strategy of always attempting
parallelism, deferring the decision to runtime when there may be more
information on which to base a decision, or using extra information
supplied by the programmer.
Restrictions and extensions of Lisp
Some Lisp constructs make parallel execution much more difficult. In
general, these are the ones that operate on the global environment of the
program, such as assignment to variables not local to the function
performing the assignment, or destructive modification of data structures
that may be shared by other tasks. Disallowing some or all of these may
increase the amount of parallelism that we are able to detect. This also
changes the language more towards "pure Lisp", a totally functional
language, and this may add evidence to the hypothesis that functional
languages are better suited for parallelism than other languages.
But we cannot eliminate non-functional constructs entirely and retain a
version of the language that is acceptable to many Lisp users. So it will
be necessary to consider the effects of allowing some or all of the
constructs that make the analysis more difficult, and see how this affects
the overall result.
A problem that can be forseen with many existing Lisp programs is their
use of lists as a basic data structure. Even if they perform only "clean"
operations on these lists, the fact remains that a list of length N
requires time at least proportional to N to perform any operation on each
element, or to search for an element satisfying some criterion. Given
enough processors, such an operation can often be done in less time by
using some other data structure, such as an array. High-level analysis
may be able to substitute an array for a list in a few cases, but in
general we will probably have to rely on the programmer to do this. If
the intended use of a list is really to represent a set of objects, rather
than a sequence, as it often is, then the best solution may be to
introduce a new data type "set" and have the compiler both decide the best
representation and produce the code to create and access the
implementation of this structure. Mapping functions, as already provided
in Lisp, are an appropriate way to specify an operation on each element of
the set.
Parallel architectures for Lisp
It is both necessary and helpful to consider the kinds of parallel
machines that Lisp programs will run on. We want to make use of the
hardware that is available or will soon be, and we also can influence the
design of future systems by showing what features are desirable.
As a basis, we assume a multiple-instruction multiple-data machine. (SIMD
has been proposed for Lisp, viz. MIT's Connection Machine, but that
approach does not look realistic.) Many applications of Lisp, such as in
Artificial Intelligence, will have programs based on searching and match-
ing algorithms that are easiest to express as multiple tasks performing
different operations based on information (such as rules) found in a
database, and therefore being in a variety of states at any time.
One issue is whether to have shared memory. This of course gives great
flexibility, but has an associated cost both in terms of actual hardware
needed, and possibly in terms of the amount of time needed to access a
memory word. To decide whether it is worth the cost, we need to implement
Lisp programs on an architecture without shared memory, and then compare
the results with those allowing shared memory. We also need to consider
the feasibilty of completely shared memory when the number of processors
gets very large. For small numbers of processors, there are already
existing systems (e.g. the HEP and the S-1) that use shared memory.
Management of the task queues is an important implementation issue. If
there is just a single queue, kept in shared memory (or by a single
processor if there is no shared memory), it is clear that there will
eventually be a bottleneck as the number of processors increases, because
the rate of accesses to the queue will be proportional to the number of
processors, while the minimum time needed per access must be bounded by
hardware.
Instead of one queue, we could have several, and have each processor only
deal with certain ones. Then we would have the problem that some
processors might be idle while tasks are waiting in queues not accessible
to them. Hence we need to introduce a load-balancing mechanism, whereby
each processor moves tasks from queues that have many tasks to ones that
have fewer. It is assumed that each queue is accessible to at least
enough processors so that a task can migrate from any processor to any
other. The organization of this network of processors and queues is one
topic to be studied, but it lends itself well to an architecture that has
memory units each shared by a subset of the full set of processors.
Goals
The goals of this thesis will be to:
(1) implement a simulator for parallel architectures of the type described
above, allowing variation of the number of processors, the cost for
task creation, and the processor/memory configuration,
(2) analyze some simple Lisp programs on several of these architectures to
get preliminary ideas about which look most promising, and narrow the
choice of architecture to one or a few promising candidates,
(3) analyze a variety of Lisp programs on the chosen architecture(s) with
an emphasis on detecting parallelism,
(4) determine what aspects of these programs helped or inhibited parallelism,
and propose restrictions or extensions to Lisp,
(5) perhaps work on an actual implementation of the system, given the
availability of parallel hardware.
∂22-May-84 0813 BARWISE@SU-CSLI.ARPA Re: Lunch Meeting at Faculty Club
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 22 May 84 08:13:17 PDT
Date: Tue 22 May 84 08:11:42-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Re: Lunch Meeting at Faculty Club
To: PAT@SU-CSLI.ARPA
cc: BMoore@SRI-AI.ARPA, JMC@SU-AI.ARPA, Lauri@SRI-AI.ARPA, Betsy@SU-CSLI.ARPA,
Stucky@SU-CSLI.ARPA
In-Reply-To: Message from "Pat Wunderman <PAT@SU-CSLI.ARPA>" of Fri 18 May 84 14:22:47-PDT
I am going to work at home this morning, so will meet you all
at the faculty club.
JOn
-------
∂22-May-84 1058 ELYSE@SU-SCORE.ARPA Re: mazda repairs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 May 84 10:58:15 PDT
Date: Tue 22 May 84 08:55:29-PDT
From: Elyse J. Krupnick <ELYSE@SU-SCORE.ARPA>
Subject: Re: mazda repairs
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 21 May 84 21:03:00-PDT
Thanks very much, John. Yes, I do have a rotary and I'll let you know
how things come out if I use them.
Elyse.
-------
∂22-May-84 1059 SCHREIBER@SU-SCORE.ARPA grades
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 May 84 10:58:52 PDT
Date: Tue 22 May 84 09:02:14-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: grades
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-AIMVAX.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Please bring or send me the grades this morning before the meeting;
I will prepare a summary
Rob
-------
I have just finished my grading, but Lamping and I haven't combined
our grades. Unfortunately, I have another meeting at noon but will
be ready in early afternoon. Sorry about that.
∂22-May-84 1144 krovetz@nlm-mcs Re: electronic library project
Received: from NLM-MCS.ARPA by SU-AI.ARPA with TCP; 22 May 84 11:44:24 PDT
Received: by nlm-mcs.ARPA (4.22/4.7)
id AA05644; Tue, 22 May 84 13:28:50 edt
Date: Tue, 22 May 84 13:28:50 edt
From: krovetz@nlm-mcs (Bob Krovetz)
Message-Id: <8405221728.AA05644@nlm-mcs.ARPA>
To: JMC@SU-AI.ARPA
Subject: Re: electronic library project
Abacus is a new magazine being edited by Anthony Ralston. It has a
fairly folksy style and is geared to the educated layman as well as
the professional. The latest issue contained the following articles:
"Computer Crime: Science Fiction and Science Fact" by Kurt Schmucker
"Abacus: The Word and the Device" by Heinz Zemanek
"Howard Aiken's Children: The Harvard Computation Laboratory and
its Students" by Gerard Salton
"Trapped in the USSR: Alexander Lerner at Seventy" by Jack Minker
It also contained a review of "The Art of Computer Programming", a
description of a legal case (Apple vs. Franklin) that involved
software copyrightability, and a Puzzles section on variations on
the Tower of Hanoi. It's put out by Springer-Verlag.
∂22-May-84 1213 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 May 84 12:13:28 PDT
Date: Tue 22 May 84 12:05:29-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 22 May 84 12:04:00-PDT
John,
It is imperitive that you come to the comp ctte meeting and
resolve your grades with Lamping's We have one thing to do today,
determine the passing grades on the exam. We cant do it unless
all of the exam has been graded. The departments rules require two
graders for every exam.
Rob
-------
∂22-May-84 1304 ALMOG@SRI-AI.ARPA a question
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 22 May 84 13:04:20 PDT
Date: 22 May 1984 1307-PDT
From: Almog at SRI-AI
Subject: a question
To: jmc at SU-AI
Hello,
I wondered whether there was a plan to have D.Kaplan come
up to Stanford with you as organizer. I'm asking because my family
will go England and while drawing plans for June I thOught I
would ask you beforehand, so that I wont miss him (i wonder
how the reference of "Him" is absolutely clear here). Many
thanks, joseph
-------
∂22-May-84 1508 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 May 84 15:08:24 PDT
Date: Tue 22 May 84 15:05:01-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-AIMVAX.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
Remember, next meeting in two weeks, June 5, usual time and place.
Please read the proposals for the meeting.
If you have exams, give them to Marilynn
And please give solutions to Phyllis, soon.
Rob
-------
∂22-May-84 1728 baskett@decwrl.ARPA IBM 801 talk
Received: from DECWRL.ARPA by SU-AI.ARPA with TCP; 22 May 84 17:26:18 PDT
Received: from acetes.ARPA by decwrl.ARPA (4.22.01/4.7.29)
id AA01520; Mon, 21 May 84 09:52:33 pdt
Received: by acetes.ARPA (4.22.01/4.7.27)
id AA00796; Mon, 21 May 84 09:53:41 pdt
From: baskett@decwrl.ARPA (Forest Baskett)
Message-Id: <8405211653.AA00796@acetes.ARPA>
Date: 21 May 1984 0953-PDT (Monday)
To: jmc@su-ai
Subject: IBM 801 talk
I took out the remarks about intra-company rivalries but I'd still
appreciate your not spreading this around since I promised George Fan
(IBM Yorktown Heights) that I wouldn't.
Forest
------
This is my report on a talk given at Stanford on April 3rd. First the
published abstract:
Albert Chang, IBM Yorktown, VLSI Seminar, Tuesday, April 3 1:15 pm
ERL 401.
Two IBM 801 Chips
Preliminary performance data and the external characteristics of two 801 type
chips will be described. The first chip is a pipelined reduced instruction
set cpu (801). Its measured performance on small kernels will be given and
an indication of the relative power of one of its instructions compared to
a 370 instruction will be discussed. The second chip is a memory management
chip. It supports very large virtual memory at low cost in terms of the real
fixed storage required for page tables. It also provides hardware support for
the locking and journalling that is commonly used in data base programming.
The way in which it is used in an experimental control program will be
described.
Now the report:
Background:
Al Chang got a Ph.D. in EE from Berkeley years ago and has been at
Yorktown Heights for a long time, I think. He started on the 801
project very near it's beginning in 1975. The best background
reading on the 801 project is "The 801 Minicomputer" by George Radin in
The IBM Journal of Research and Development, Vol. 27, No. 3, May 1983.
This article is a slightly expanded version of the paper Radin
presented at the ACM Symposium on Architectural Support for Programming
Languages and Operating Systems in March of 1982. More details are
included in the IBM Journal version.
Motivation:
It came out at the end of the talk that these chips (at least the CPU
chip and I believe the MMU chip, as well) were designed by the IBM
Office Products people in Austin, Texas, the people who brought you the
Displaywriter. (censored part) At any rate, it is widely
believed that this is the chip set that will be in the machine that
is about to be delivered to CMU as part of the big IBM-CMU program. In
addition, even the trade press is starting to figure out what is going
on and is talking about IBM coming out with a proprietary CPU in their
"next generation PC". This project has long had the code name ROMP.
The talk:
The block diagram was
----- -----
| CPU |---------| MMU |-----Memory
----- | -----
|
I/O
This presumably implies I/O instructions rather than memory mapped I/O.
Nothing further about I/O was mentioned. The CPU was described as
RISC, 32 bits, pipelined, with cycle time T. The design target for T
was 200 nanoseconds but the chips seem to run at 160 ns with selected
parts running at 150ns. The MMU supports a large virtual memory (2**40
bytes), has data base support, is pipelined, and has the same pipeline
cycle time. The memory is plain Nmos with an access time of approximately
T and a cycle time of 2T. It can be two way interleaved to reduce
interference. If it is not so interleaved, there could be substantial
speed degradation due to memory interference on successive instructions.
The CPU has 16 registers (the Yorktown Heights people think this is too
few) which are 32 bits. Instructions are either 16 bits or 32 bits.
The 16 bit instructions are of the form:
OP R1, R2
where OP is 8 bits and R1 and R2 are 4 bit register designators. The
32 bit instructions are of the form:
OP R1, R2, D
where D is a 16 bit displacement, sometimes signed, sometimes not.
This form provides 16 bit literal operands and 16 bit displacements for
the load and store instructions. It is a load/store machine in that
only the load and store instructions have storage operands. This has
the usual simplifying effect on the interrupt and virtual memory
implementation. Most instructions are one cycle (if they are not loads
or stores or branches). There are a few microcoded, multiple cycle
instructions. One pair is a load or store multiple registers and another
is load program status (load PSW in IBMese). These instructions are supposed
to help relieve the load on the single port to memory in the same way
that the 16 bit instructions do (less instruction traffic to interfere
with the data traffic). In addition, there are a "small number" of
three register operand instructions of the form:
OP R1, R2, R3
The pipeline organization was diagrammed in what looked to me like the
standard way with a register file with two output ports and two input
ports, an ALU with two input ports and one output port and at least one
bypass from ALU out to ALU in. His diagram only showed one bypass but
it left out a lot so there could be more. It's the standard scheme for
pipelining one cycle ALU operations in a register to register environment.
The extra input port on the register file is for loads.
The Load and Stores were more interesting because they were so slow: 5
cycles with address translation on and 4 cycles with it off, diagrammed
as follows:
| Load | Addr | Xlate | Memory | Reg File |
+------+-------+--------+--------+----------+
When address translation is off, the Xlate cycle is deleted. When it
is on, the CPU waits for the data in order to achieve precise
interrupts if there is a fault. When it is off, the CPU continues
until the data is required. Instruction fetch continues in either
case. The compiler is able to schedule 90% of the loads so that there
is a useful instruction between the load and the use (for the Xlate off
case) and 80% of the loads so that there are two useful instructions
between the load and the use. The memory system was not described so
this explanation could be a little simple compared to reality.
Branches take one cycle if the branch is not taken, 5 cycles if the
branch is taken. There is a "branch and execute" form in which the
instruction following the branch is executed no matter which way the
branch goes. Thus the taken path is effectively 4 cycles for this form.
The load multiple instruction takes 3+ceiling(3R/2) cycles were R is
the number of registers being loaded. The store multiple instruction
takes 3+2R cycles.
The compiler is the PL8 compiler. It mainly compiles PL8, a PL/I like
language for systems programming. It is about 100K lines of code that
compiles into 1.5 megabytes of flattened executable image. It compiles
to about five different machines, including various versions of 801's,
the 370, and the 68000. It also compiles Pascal source and they expect
to be able to compile C source soon. A table of instruction
frequencies was given for three "programs". One was a data base system
they have done that implements the Sequel interface. One was the
"system" which was their monitor and a lot of utilities. The third was
the PL8 compiler itself. These are dynamic instruction frequencies.
Instruction % Sequel System PL8
Register ops 52.9 50.4 52.2
Loads 23.7 19.6 21.6
Stores 9.3 8.9 9.6
Branches taken 9.0 15.7 11.5
Branches not taken 3.8 3.8 4.0
Load/Store multiple 1.3 1.6 1.1 (8 registers, average)
Average cycles per 2.93 3.00 2.86
instruction
Number of instructions 30M 30M 600M
Other effects such as memory interleave interference and translation
buffer misses accounted for 0.3 cycles per instruction in addition to
the above. These numbers together with the 160 ns cycle show you where
the 2.2 MIPS number that John Cocke has been giving people comes from,
I believe.
Al then presented, with some reluctance, the following simple minded
benchmark numbers, probably out of deference to the Berkeley crowd
since he was scheduled to give the talk at Berkeley the next day.
He complained about the relevance of small kernals.
Time in milliseconds
Machine Language Acker Sieve Puzzle
11/780 C (VMS) 4222 116 4625
68000 Pascal 3080 246 9200
(16 MHz)
80286 Pascal 2218 168 9138
(8 MHz)
IBM RISC -- 2400 80 3800
(6.25 MHz) (PL8) (PL8) (Pascal)
Code size in bytes
11/780 152 156 2220
68000 126 228 2940
80286 --- --- ----
IBM RISC 159 202 2454
The numbers not done at IBM (780 and 286) were taken from the relevant
latest versions in Computer Architecture News.
Then, with more enthusiasm, he gave these comparisons for seven
unidentified applications programs.
10**6 instructions executed
PL8 RISC 370
1 103.0 63.7
2 171.9 107.0
3 48.8 40.0
4 88.6 71.0
5 115.8 94.4
6 49.9 38.1
7 85.3 60.5
--- ----- -----
total 663.3 474.7
overall 370/RISC = 0.715 (dynamic)
In the total number of static instructions in these 7 programs, the
IBM RISC and the 370 were about the same. Two thirds of the dynamic
excess of IBM RISC over the 370 were said to be due to the move and
multiply subroutines. The IBM RISC numbers were gathered with a
software trace. The 370 numbers were gathered with a hardware monitor
on a 370/168 which excluded all the CP/CMS system code. These programs
were said not to be commercial - no decimal - and said not to be
scientific - no floating point - but to be representative of systems
code. The average instruction size was also given: 2.85 bytes for the
IBM RISC and 3.5 for the 370.
The MMU chip supports a page size of 2048 bytes. The addresses are
byte addresses. The CPU presents 32 bits of address to the MMU, the
top four of which are a segment ID, the other 28 being an offset within
that segment. The segment registers in the MMU are 12 bits of address
that get put on the top of the 28 bit offset for a 40 bit virtual
address. The segment registers also contain a "special" bit that
controls whether the database stuff is active or not. It also contains
a "key" bit that has something to do with storage keys. I got the
impression that Al didn't want to explain this one because it was
embarrassing. The MMU keeps a 16 x 2 two way set associative translation
look aside buffer. In the monitor they are running, they map files into
segments, one file per segment. They expect most of the files in a
data base system to be relatively small so the 2**28 bytes maximum size
shouldn't be a problem. The special bit is meant to generate
interrupts to the monitor (control program in IBMese) so that locking
and journalling can be supplied by the monitor. The support is such
that one can get an interrupt on the first reference by a transaction
to a 128 byte line of data. The PL8 language has an added "Persistent"
storage class so that PL8 variables may be associated with permanent
segments (or 128 byte lines, I think):
DCL X(100) CHAR(80) PERSISTENT
OPEN (X, 'NAME', options)
X(1) = 'anything'
COMMIT (X)
Compiled code is independent of options such as "shared", "journalled",
"locks", etc. The page table in the MMU is the same organization
as used in the System 38 and gives a reversible map between
virtual and real addresses organized as a hash table as follows. If
one has N real pages (where N = 2**k for some k) then there is a 2N
entry hash table that points to an entry in the N entry page frame
table. The mth entry in the page frame table describes real page m.
That entry contains the virtual page number, a "next" pointer (for hash
collisions), a R/W bit, a TID (transaction id), and 16 lockbits, one
for each 128 byte line of a page. This whole structure was said to take
20N space, where units were not defined but I believe were bytes. It was
never suggested how big N could be. I believe N to be at least 1024.
That would mesh with the CMU talk of a workstation with "a couple of
megabytes".
Al said that, for a TLB miss, they typically got 2.2 references in the
hash table/page frame table, i.e., the probability of no chaining was
close to 90 percent. The R/W, TIB, and Lockbits apply only if the special
bit is on in the segment register. The MMU has a TIDREG (transaction id
register). An interrupt is generated by the MMU for a load/store to line N:
if TID ~= TIDREG (not equal)
if store, R/W = R or Lockbit(N) = 0
if Load, R/W = R and Lockbit(N) = 0
At this point it was decided that the talk had gotten too low level and
that the time was up anyway so we switched to questions. The
technology questions revealed that the chips are Nmos, 2 micron feature
size, with about 7.5 mm per side. Al said it does a bit better than a
4341 in raw CPU power, giving about 1.4 370 MIPS or 2 RISC MIPS. He
also said that the version they are running in Yorktown Heights has a
bug where instructions cross a page boundary and there is a fault on
both instruction and data references so they compile around it.
Additional speculation: APA displays (IBMese for "all points
addressable) have been big inside IBM for some time now and Jim Gosling
(author of the VAX Emacs screen editor) demonstrated a really nice
WYSIWYG (what you see is what you get) editor on a Sun workstation at
the recent Sun users group meeting. It wasn't available since Jim
works for IBM on the CMU project and the Sun was just their interim
development machine. Thus one would reasonably expect the ROMP's that
CMU gets to be like Sun workstations with these chips in them.
After the talk, (censored) people muttered
about how slow these chips were and how much better one could do if one
did things "right". Comments from Al pointed out that this system was
designed to be cheap and that accounted for some of the slowness of the
memory system.
Forest
∂23-May-84 1155 AAAI-OFFICE@SUMEX-AIM.ARPA [Elaine Rich <CS.RICH@UTEXAS-20.ARPA>: Re: special parking priviledges]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 23 May 84 11:54:36 PDT
Date: Wed 23 May 84 11:55:14-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: [Elaine Rich <CS.RICH@UTEXAS-20.ARPA>: Re: special parking priviledges]
To: JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
What do you thinK?
Claudia
---------------
Return-Path: <CS.RICH@UTEXAS-20.ARPA>
Received: from UTEXAS-20.ARPA by SUMEX-AIM.ARPA with TCP; Wed 23 May 84 11:38:27-PDT
Date: Wed 23 May 84 13:38:00-CDT
From: Elaine Rich <CS.RICH@UTEXAS-20.ARPA>
Subject: Re: special parking priviledges
To: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Tue 22 May 84 17:06:55-CDT
I talked to Univ. Police. They said that the week before the meeting I
need to call and get McCarthy put on their list of visitors. Then he
will show up at the appropriate gate into campus and tell them who he is
and they'll tell him were to go and give him a temporary permit.
Elaine
-------
-------
∂24-May-84 0304 @MIT-MC:RWG@MIT-MC convergep
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 24 May 84 03:00:57 PDT
Received: from MIT-MC by MIT-OZ via Chaosnet; 24 May 84 06:01-EDT
Date: 24 May 1984 06:01-EDT
From: Bill Gosper <RWG @ MIT-MC>
Subject: convergep
To: AMO @ MIT-MC, WGD @ MIT-MC, ALAN @ MIT-MC, BMT @ MIT-MC,
RZ @ MIT-MC, ramshaw @ PARC-MAXC, jmc @ MIT-OZ,
acw @ SCRC-STONY-BROOK
cc: ES @ MIT-MC, REM @ MIT-MC
I have a convergence test for nonoscillatory summands that seems
to work and reduces the problem to whether a single limit is
infinite or 0. (There appears to be no closed-form summand
for which limit is finite.) If a[n] is the summand, look at
f(n) = a[2↑n]/(a[n] (1 - a[1+2↑n]/a[2↑n])).
I claim sum(a[n]) diverges when this blows up with n, converges if
f(n) goes to 0. Problem: construct a reasonably simple
a[n] where f(n) stays finite. Then study convergence of sum(a[n]).
Has anyone seen a test like this?
Warning: you will probably need wgd's nhayat as soon as the summands
get serious. (like 1/n↑n↑(1/n), 1/n↑e↑(1/sqrt(log(n))),
e-((n+1/2)/(n-1/2))↑n, etc..
∂24-May-84 0911 ZAUDERER@SU-SCORE.ARPA typewriter
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 84 09:11:33 PDT
Date: Thu 24 May 84 09:08:58-PDT
From: Shanee Zauderer <ZAUDERER@SU-SCORE.ARPA>
Subject: typewriter
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-3125
Your typewriter has been returned, thanks for letting us use it.
-------
∂24-May-84 1030 MULLEN@SUMEX-AIM.ARPA THERE WILL BE NO SIGLUNCH THIS FRIDAY, MAY 25, 1984,
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 May 84 10:30:23 PDT
Date: Thu 24 May 84 10:27:36-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: THERE WILL BE NO SIGLUNCH THIS FRIDAY, MAY 25, 1984,
To: siglunch@SUMEX-AIM.ARPA
-------
∂24-May-84 1329 SAMUEL@SU-SCORE.ARPA re: BBS Confiscation (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 84 13:29:21 PDT
Date: Thu 24 May 84 13:26:39-PDT
From: Sam Hahn <Samuel@SU-SCORE.ARPA>
Subject: re: BBS Confiscation (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
Here's a followup message. I hope it's more informative than the previous.
-- sam hahn
24-May-84 13:09:57-PDT,1284;000000000005
Return-Path: <info-cpm-request@AMSAA.ARPA>
From: ssalzman.es@XEROX.ARPA
Date: 24 May 84 11:11:09 PDT
Subject: Update on MOG-URs BBS Confiscation
Rick Gaitley, who is sysop of Xanadu RCPM/ and a friend of Tom's,
decided to cal the phone company and find out why his system was
confiscated. Apperently, someone left an AT&T calling card number
on Tom's board and it remained there for over a month. It's very
possible that Tom had no idea of that message being there. Ths
same caling card number showed up on Xanadu after Tom left the
message there about what happened to his board. Rick immediatly
deleted it. At any rate, I can see why the phone company might get a little
ticked off. According to the phone company, the reason they took
the system (suuposedly) was to try and find the person who left
the message. The person Rick talked to is the one that actually
took Tom's machine. If anyone cares to find out any more,
the number of Ricks system (Xanadu) is (818)906-1636.
- Isaac Salzman
Ssalzman.es@Xerox
-------
∂24-May-84 1351 RPG
;; Message from MWALKER@SU-SCORE.ARPA (1349)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 84 13:49:07 PDT
Dick, was paper work ever done for your senior res. appointment? Before
the Reg. office will officially give you a section # your appointment
papers have to go through. They don't find anything on that and Gene
Golub's sec. has not seen anything either.
Marilynn
∂24-May-84 1358 RPG appointment
∂24-May-84 1356 MWALKER@SU-SCORE.ARPA appointment
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 84 13:55:43 PDT
Date: Thu 24 May 84 13:51:51-PDT
From: Marilynn Walker <MWALKER@SU-SCORE.ARPA>
Subject: appointment
To: rpg@SU-AI.ARPA
This will also effect reading committee stuff as well so it's really
important to take care of this.
thanks, Marilynn
-------
∂24-May-84 1906 CHANDRASEKARAN@RUTGERS.ARPA AAAI Grant
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 24 May 84 19:06:37 PDT
Date: 24 May 84 22:06:17 EDT
From: Chandra-at-OhioState <Chandrasekaran@RUTGERS.ARPA>
Subject: AAAI Grant
To: JMC@SU-AI.ARPA
cc: PSZ@MIT-MC.ARPA, Shortliffe@SUMEX-AIM.ARPA
I would like to express the AIM Workshops thanks for the
support rom AAAI. This will definitely help.
-------
∂24-May-84 2246 SHORTLIFFE@SUMEX-AIM.ARPA AAAI grant to AIM Workshop
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 May 84 22:46:21 PDT
Date: Thu 24 May 84 22:47:52-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: AAAI grant to AIM Workshop
To: jmc@SU-AI.ARPA
cc: CHANDRASEKARAN@RUTGERS.ARPA, psz@MIT-MC.ARPA
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
John,
Let me add my thanks to that of Chandra. I'm delighted that
the AAAI will be able to help support grad student attendance in this
way.
Regards,
Ted
-------
∂24-May-84 2352 SAMUEL@SU-SCORE.ARPA [Phil Lapsley <phil%ucbnewton.CC@Ucb-Vax.ARPA>: [BBS Flame] A Legal View]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 84 23:52:46 PDT
Date: Thu 24 May 84 23:50:04-PDT
From: Sam Hahn <Samuel@SU-SCORE.ARPA>
Subject: [Phil Lapsley <phil%ucbnewton.CC@Ucb-Vax.ARPA>: [BBS Flame] A Legal View]
To: jmc@SU-AI.ARPA
cc: bboard@SU-SCORE.ARPA
And, just to finish things off, I hope this also helps to clarify. -- sam
---------------
Return-Path: <info-cpm-request@AMSAA.ARPA>
Received: from AMSAA by SU-SCORE.ARPA with TCP; Thu 24 May 84 21:16:37-PDT
Received: From ucb-vax.arpa.ARPA by AMSAA via smtp; 24 May 84 23:36 EDT
Received: from ucbjade.CC.Berkeley.ARPA (ucbjade.ARPA) by UCB-VAX.ARPA (4.24/4.27)
id AA04395; Thu, 24 May 84 20:39:52 pdt
Received: from ucbruby.CC.Berkeley.ARPA by ucbjade.CC.Berkeley.ARPA
(4.14.3/4.16) id AA23530; Thu, 24 May 84 20:40:31 pdt
Received: by ucbruby.CC.Berkeley.ARPA
(4.14.3/4.16) id AA19288; Thu, 24 May 84 20:40:09 pdt
Received: by ucbnewton.Berkeley.ARPA (4.6/4.25)
id AA13368; Thu, 24 May 84 20:39:32 PDT
Date: Thu, 24 May 84 20:39:32 PDT
Message-Id: <8405250339.AA13368@ucbnewton.Berkeley.ARPA>
From: Phil Lapsley <phil%ucbnewton.CC@Ucb-Vax.ARPA>
To: info-cpm@amsaa.ARPA
Subject: [BBS Flame] A Legal View
Permit me just one flame on this, then I shut up...
While I can't say what specific law was broken, not being very familiar
with the case at hand, I could offer some speculation. In all probability,
Tom was charged under section 502 of the California Penal Code, which deals
with "Crimes Using Computers." Apparently there has been some addition to
this section as of January of this year, and I'm not sure as to its
contents, but it probably (?) doesn't change things too drastically.
Section 502. uses the following definitions:
"Access" means to instruct, communicate with, store data in, or retrieve
data from a computer system or computer network.
"Services" includes, but is not limited to, the use of the computer system,
computer network, computer programs, or data prepared for computer use, or
data contained within a computer system, or data contained within a
computer network.
"Property" includes, but is not limited to, financial instruments, data,
computer programs, documents associated with computer systems and computer
programs, whether tangible or intangible [?], including both human and
computer system readable data, and data while in transit.
Armed with the above definitions, section 502(b):
"Any person who intentionally accesses or causes to be accessed any
computer system or computer network for the purpose of (1) devising or
executing any scheme or artifice to defraud or extort or (2) obtaining
money, property, or services with false or fraudulent intent,
representations, or promises shall be guilty of a public offense."
502(d):
"Any person who violates the provisions of subdivision (b) or (c) is guilty
of a felony and is punishable by a fine not exceeding five thousand dollars
or by imprisonment in the state prison for 16 months or two or three years,
or by both such fine and imprisonment, or by a fine not exceeding two
thousand five hundred dollars, or by imprisonment in the county jail not
exceeding one year, or by both such fine and imprisonment."
And why not 502(e):
"This section shall not be construed to preclude the applicability of any
other provision of the criminal law of this state which applies or may
apply to any transaction."
This brings us to section 502.7 of the California Penal Code, which reads
as if it was written by old Ma Bell. Specifically, 502.7(c):
"Any person who publishes the number or code of an existing, canceled,
revoked, expired, or nonexistent credit card ... with the intent that it be
used or with knowledge or reason to believe that it will be used to avoid
the payment of any lawful telephone or telegraph toll charge is guilty of a
misdemeanor."
And we would not want to be without 502.7(g):
"An instrument, apparatus, device, plans, instruction, or written
publication described in subdivision (b) or (c) of this section may be
seized under warrant or incident to a lawful arrest, and upon the
conviction of a person for a violation of subdivisions (a), (b), or (c) of
this section, such instrument, apparatus, device, plans, instructions, or
written publication may be destroyed as contraband by the sheriff of the
county in which such a person was convicted or turned over to the person
providing telephone or telegraph service in the territory in which the same
was seized. [i.e., Pacific Telephone]"
I suppose I could see the above being used as a legal defense of the
BBS bust along lines something like: "Well, the bulletin board provided
a credit card number, and somebody used it. Making use of a credit
card number for fraudulent purposes when the number is provided by a
computer is a felony under section 502(b) of the California Penal
Code. The sysop of the BBS provided this service and therefore acted
as an accomplice, and is therefore equally guilty under the eyes of the
law. Further, the message containing the credit card number is liable
to be seized under warrant by section 502.7(g) of the CPC, and turned
over to Pacific Telephone."
I will refrain from making any statements for or against the above
laws, but the fact remains that they are on the books in California,
and they should either be changed, or abided by, depending upon your
view.
Phil Lapsley
(phil@Berkeley.ARPA)
-------
∂25-May-84 0926 TREITEL@SUMEX-AIM.ARPA re: UCLA Students Would Reelect Ronald Reagan (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 May 84 09:26:00 PDT
Date: Fri 25 May 84 09:28:30-PDT
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: UCLA Students Would Reelect Ronald Reagan (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA, treitel@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 24 May 84 19:56:00-PDT
I guess I've gotten so used to detecting and discarding such subjective
opinions from people's "analyses" of whatever that I don't give it a second
thought. The basic idea, which I have had in my head for quite some while, is
that all communication acts by humans are intended to produce some effect,
which need not be limited to (and often does not include) the transfer of
information. Reading between the lines is so much more fun than reading on
them.
- Richard
-------
∂25-May-84 1345 CS.PETRIE@UTEXAS-20.ARPA AI Journal Article
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 25 May 84 13:45:30 PDT
Date: Fri 25 May 84 15:39:07-CDT
From: Charles Petrie <CS.PETRIE@UTEXAS-20.ARPA>
Subject: AI Journal Article
To: JMC@SU-AI.ARPA
cc: GROSOF@SUMEX-AIM.ARPA
I am very interested in your work on circumscription. Could I please
receive a draft copy of your latest article to the journal?
My address is: MCC
9430 Research Blvd.
Echelon Bldg. #1, Suite 430
Austin, TX 78759-6509
ATTN: C. PETRIE
Thanks for your help.
Charles Petrie
←←←←←←
-------
∂25-May-84 1546 JK define
To: JMC, EXM
has been fixed
∂26-May-84 1716 JK
To: JMC, LEP
There is a new improved derive that does better on equalities
and arguments by cases (does some proofs by cases)
For example,
(derive |(∀X Y.X=A∧Y=B ∨ X=B∧Y=A ∨ X=Y ⊃ Y=A∧X=B ∨ Y=B∧X=A ∨ Y=X)∧
(∀X Y Z.(X=A∧Y=B∨X=B∧Y=A∨X=Y)∧(Y=A∧Z=B∨Y=B∧Z=A∨Y=Z)⊃X=A∧Z=B∨X=B∧Z=A∨X=Z)|)
takes now 20s
Also, the big step
21. (der |bird#16∧bird#17∧bird#18∧bird#19∧bird#20| () (open ab2 flies2))
in bird.lsp takes just 2s now
∂27-May-84 0430 @MIT-MC:RWG@MIT-MC easier convergp
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 27 May 84 04:30:25 PDT
Received: from MIT-MC by MIT-OZ via Chaosnet; 27 May 84 07:33-EDT
Date: 27 May 1984 07:29-EDT
From: Bill Gosper <RWG @ MIT-MC>
Subject: easier convergp
To: ES @ MIT-MC, AMO @ MIT-MC, WGD @ MIT-MC, ALAN @ MIT-MC,
REM @ MIT-MC, RZ @ MIT-MC, BMT @ MIT-MC, NJAS @ MIT-MC, dek @ SU-AI,
guibas.pa @ XEROX, ramshaw.pa @ XEROX, jmc @ MIT-OZ
cc: RWG @ MIT-MC, rww @ SU-AI
Claim: If a[n] is a non-oscillatory summand, then the infinite sum converges
or diverges as
d
f(n) = 2↑n a[2↑n]/a[n]
goes to 0 or infinity, respectively. You can use 3↑n or fib(n) or any
exponential progression in place of 2↑n. There is probably no
closed form a[n] for which f(n) approaches a finite asymptote. For
closed form a[n], you can use the even simpler
d
f(n) = n a[n]/a[log(n)].
This seems too easy. Is it old? Is it wrong??
∂27-May-84 1812 JK
∂26-May-84 1844 JMC
What is the correct reference to the notion of direct proof?
\noindent{\bf Ketonen, J.A. and Weyhrauch, R. (1983)}:
``A Decidable Fragment of Predicate Calculus'',
accepted for publication in the Journal for Theoretical Computer Science,
20 pp. (1984).
∂27-May-84 1941 ME returned bboard mail
∂27-May-84 1907 JMC returned bboard mail
When I mail to su-bboards or other-bboards, I get my mail back that was
addressed to temporarily disconnected computers or computers that
grumble about a lack of subject field. There should be some way of
avoiding this - of having the computer simply forget returned mail
addressed to bulletin boards.
ME - I'm afraid it's you who must implement this feature, in your
own editing techniques, by simply deleting such returned mail if
you don't want to do anything about it.
∂28-May-84 0900 JMC*
amex, psa, agerwala
∂28-May-84 1522 SCHREIBER@SU-SCORE.ARPA [Arthur Keller <ARK@SU-AI.ARPA>: About Changing the Comprehensive Programming Project ]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 May 84 15:21:48 PDT
Date: Mon 28 May 84 15:18:11-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: [Arthur Keller <ARK@SU-AI.ARPA>: About Changing the Comprehensive Programming Project ]
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-AIMVAX.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
FYI, concerning the proposal to change the programming exam. -- Rob
---------------
1) 27-May Arthur Keller About Changing the Comprehensive Programming
2) 28-May Joan Feigenbaum more on programming project
Message 1 -- ************************
Return-Path: <ARK@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Sun 27 May 84 22:07:31-PDT
Date: 27 May 84 2209 PDT
From: Arthur Keller <ARK@SU-AI.ARPA>
Subject: About Changing the Comprehensive Programming Project
To: Bureaucrats@SU-SCORE.ARPA
CC: Schreiber@SU-SCORE.ARPA, Nilsson@SRI-AI.ARPA, ARK@SU-AI.ARPA
The Comprehensive Examination has changed several times while I've been
here as a student. For the most part, those changes have been based on
considerable discussion and deliberation.
The Comprehensive Exam was (in 1977) required for PhD students and MS
students (but not MSCE students). The written part of the Comp was then
as is now, offered twice a year, and you had four times to pass it. Also,
there were two levels of passes, MS and PhD, as well as conditional PhD
passes. The programming project was a 5 day affair, given out 1pm on
Thursday and due 12 noon the following Tuesday. You were required to pass
both parts (written and programming) at the same time. The programming
part was offered a week or so after the written part, and you got some
clue whether it would be worth your while to do the programming part based
on your score on the written part. How you did on the programming part
might affect what happened to a marginal PhD passing score. There was a
change to decouple these so you could pass them at different times. This
was the best change ever made to the comp, in my opinion.
In June 1979, after a PhD student failed the written part of the Comp for
the fourth time, the department voted to require that a meeting be held
with each student who failed for the second time or had only one chance
left to assess the reason for failing and determine what had to be done to
correct the problem. (This rule saved a number of people in June 1982
because no meetings had taken place in between the winter and spring comps
of 1982.)
I think it was in June 1980 that they decided to change the programming
project to the current format. More recently, the written exam was
changed to a closed book exam (it had been open book) consisting of 6
separately timed parts on two days. The MS degree requirements have been
changed so that the comp is no longer required. So, the programming
project is now taken only by PhD students (and masters students under the
grandfather clause).
What were the reasons for the change? These reasons (already mentioned by
others in this discussion) were used at the time. (1) The 5-day format is
too grueling. (2) The programs for the programming project were toy
programs of no use. (3) Students could do something as part of their RAs
to pass the requirement under the changed system.
Under the old system, many people completed both parts of the programming
project quite early. Some as early as the middle of the first year, many
by the end of the first year, and most by the middle of the second year.
Very few finished after that. Under the current system, however, very few
students finish before the end of the second year. (How many students are
working now on their programming projects to complete them by the end of
this quarter, the end of their second year?)
I wish to point out that this is not the first year in which there were a
lot of people who had not passed the programming project before spring
quarter of the third year. It happened in 1982 (the first time it took
effect) and in 1983. In fact, so many people were later in 1982, we had
to extend it so you could do it over the summer following the second year
for that year only.
That slight delay adversely affects the ability of the student to take a
qual at the end of the second year, putting a lot of pressure on the
student at the end of the third year when some qual *must* be passed. I'd
be interested to see how many students pass the qual before spring quarter
of the third year compared with the figures for before the change. Thus,
the new system is having a strong adverse effect on the progress of grad
students.
The department offered a course that was particularly well suited to
passing the programming project, CS204. It was precisely the kind of
effort sustained in that course that led to passing this part.
Furthermore, by taking CS204 in the fall of the first year, you got
intensive introduction (by fire, er, use) to the computer systems, and
there was a lot of interaction among the students. CS204 no longer serves
this purpose, which has led to moving it to Winter quarter, and many
students question its relevance. I personally think I learned more from
that course than any I have taken since.
Well, it's about time I bring this diatribe to an end. Let me close with
my personal recommendations.
1. Bring back the one week blitz programming project, Thursday to
Tuesday, etc.
2. But give people the opportunity to do something else, under certain
circumstances.
a. You have to apply for the "something else" option by the end of your
third quarter. Your application must include a description of the problem
you want to solve and the approval of a supervisor.
b. You must turn in the design for your program no later than the end of
your fourth quarter.
c. You must turn in the completed working program no later than the end
of your fifth quarter.
d. It is graded during your sixth quarter. If it fails, you have the
rest of your sixth quarter to correct it.
e. If you desire, you may at any time decide to take the blitz
programming project, even if you have applied for or received permission
to do the "something else".
Respectfully submitted,
Arthur
Message 2 -- ************************
Mail-From: JF created at 28-May-84 15:15:20
Date: Mon 28 May 84 15:15:20-PDT
From: Joan Feigenbaum <JF@SU-SCORE.ARPA>
Subject: more on programming project
To: schreiber@SU-SCORE.ARPA, winslett@SU-SCORE.ARPA, berglund@SU-SCORE.ARPA,
ark@SU-AI.ARPA, jjw@SU-AI.ARPA
i want to make this very short, because we are all swamped with things to
read about the proposed change. much has been said about the effect on the
students' health, somewhat less has been said about the effect on the
students' course work in discussing the 5-day marathon. but what about
the effect on the department computers? if this plan goes through, can't
"they" at least require that different people work on it different weeks?
if several dozen people use score to do a programming project all in the same
week, none of the rest of us are going to be able to use score for anything
during that week!
joan
-------
-------
schreiber%score,ark
programming project
Arthur Keller's proposal that a student be allowed to substitute (with
approval) a present style programming project for the blitz test is ok
provided the faculty member is really prepared to evaluate it. I, for
example, would probably not agree to supervise any unless it were something
I knew I wanted anyway. I don't agree with Joan Feigenbaum's objection
that the blitz programming project would tie up the computers too much.
a. It's a worthy cause.
b. It wasn't too bad then.
c. We have more computer facilities now.
∂28-May-84 1930 VAL
There will be new results in my talk on 5/30. - Vladimir
∂28-May-84 2031 MA (finally) quals
To: ZM, JMC
Would this Thursday around 11 be a good time for both of you? Any time
after that is also good for me.
Martin
∂29-May-84 0406 ARK JJW on programming project
∂28-May-84 1629 JJW re: more on programming project
To: JF@SU-SCORE.ARPA, schreiber@SU-SCORE.ARPA,
winslett@SU-SCORE.ARPA, berglund@SU-SCORE.ARPA, ARK@SU-AI.ARPA
[In reply to message from JF@SU-SCORE.ARPA sent Mon 28 May 84 15:15:20-PDT.]
Given the present computing resources, I think this would be a serious
problem. Those who were around before summer 1980 can tell us whether there
was a resource crunch during those programming projects. I think the
natural tendency to work at night would alleviate this somewhat. Choosing
projects that don't require much CPU time could also help.
One of the department's goals for the future is to increase the amount of
computing power available. We will never be happy until there is more than
enough supply to meet the demand, so that peak demands like this won't slow
things down. One approach is to provide personal workstations for more
people. This seems to be getting more expensive than it was once thought to
be. Another is to buy a large timesharing system, and the department has
expressed a desire to do so under the ARPA equipment grant. I don't want to
get into any more detail here, since we're discussing the programming
project. This is just to say that several years from now, if all goes well,
resources may be less of a problem.
Earlier today I sent a long reply to the original message; it should appear
in the bureaucrats' file of replies soon, if it hasn't already. But I
didn't think of raising this issue, so I'm glad that you did.
Joe
P.S. I don't like the idea of assigning different weeks to different people.
It stretches out the grading, unless you wait for everyone to finish, and
it gives an unfair disadvantage to those doing the project earlier, since
the others will have heard what it is before they begin. (There's no way
to keep it a secret; trying to do so even goes against the Honor Code.)
∂29-May-84 0839 BARWISE@SU-CSLI.ARPA Rob Goldblatt
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 May 84 08:39:24 PDT
Date: Tue 29 May 84 08:35:31-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Rob Goldblatt
To: Briansmith@XEROX.ARPA, tw@SU-AI.ARPA, goguen@SRI-AI.ARPA,
meseguer@SRI-AI.ARPA, jmc@SU-AI.ARPA
cc: barwise@SU-CSLI.ARPA
I have received a letter from Rob Goldblatt, who has written a Springer
Lecture notes on "Axiomatizing the logic of computer programming."
He would like to spend 6 months to a year here, partially on his own
funds, but he would need help. I will have Pat copy the letter and send
it to you to see if any of you are especially interested. If I don't
hear positively from some of you in a week's time, I will assume that
you are not interested.
Jon
-------
∂29-May-84 1205 PW LISPM login
I created a "user object" for you on the 3600. This nonsense is part of the
new release from Symbolics. The function to create or edit namespace objects is
(tv:edit-namespace-object)
This throws you into a menu oriented editor which is documented on Volume 7
of the Symbolics manual set.
∂29-May-84 1304 PHY lunch Wednesday
Don says `fine' -- meet at Faculty Club at 11:45 - reservation for two in
name of Knuth.
-Phyllis
∂29-May-84 1438 WALTON@SU-SCORE.ARPA louis lerman
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 84 14:38:03 PDT
Date: Tue 29 May 84 14:35:10-PDT
From: Melba Walton <WALTON@SU-SCORE.ARPA>
Subject: louis lerman
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-2273
re: attendance at the soviet consulate tomorrow for Sakharov.
You and anyone else you would know
497-1540
-------
∂29-May-84 1528 BERG@SU-SCORE.ARPA textbook order
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 84 15:28:27 PDT
Date: Tue 29 May 84 15:22:56-PDT
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: textbook order
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
If you are planning to use a textbook in your autumn quarter course,
please give me the bibliographic data as soon as possible.
The bookstore will be ordering all textbooks within the next couple
of weeks, and have asked that all orders be turned in. I realize
that the quarter does not begin until late Sept, but we have to
"compete" for available textbooks with colleges whose semesters begin
in August.
Thanks for your cooperation,
Kathy
-------
∂29-May-84 1545 YEARWOOD@SU-SCORE.ARPA Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 84 15:44:52 PDT
Date: Tue 29 May 84 15:42:08-PDT
From: Marlene Yearwood <YEARWOOD@SU-SCORE.ARPA>
Subject: Secretary
To: jmc@SU-AI.ARPA, zm@SU-AI.ARPA
cc: phy@SU-AI.ARPA, haunga@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2266
I'm sure you will be happy to hear that Fran will return tomorrow, 5/26/84.
As I explained earlier, she is willing to stay and work until a replacement
for Diana is found. Her social security does not allow her to earn beyond
a certain amount of money, so hopefully, a suitable secretary will be found
before this time.
For your information, Fran's brother passed on while she was visiting back
east.
marlie
-------
∂29-May-84 2200 REGES@SU-SCORE.ARPA Purging files
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 84 22:00:44 PDT
Date: Tue 29 May 84 21:58:02-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Purging files
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
Before I purged files I mentioned the problem to Len Bosack to see if he was
willing to pick up the charges for the disk use (over $1000/month) under the
facilities budget, but he said he couldn't. I think it is quite ludicrous to
delete these files given that SCORE is very underfull. If we get the cheap
archival storage you are proposing I assume we can bring these files back online
without eating into our forum funds too much. Another alternative would be to
try to convince Len that this is really something that Facilities should be
willing to pay for. I haven't been very successful at that. I even found it
difficult to convince Len that the data base work my programmers do for the
Departmental data base (that does charging for CF as well) was something
Facilities should be supporting.
-------
∂29-May-84 2219 Brachman@SRI-KL.ARPA AAAI Conference Scheduling
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 29 May 84 22:18:57 PDT
Date: Tue 29 May 84 14:36:10-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
Subject: AAAI Conference Scheduling
To: JMC at SU-AI
cc: AAAI-Office at SUMEX-AIM
Hi, John. I am in the midst of putting together the schedule for the
conference in Austin, and just wanted to check with you on the
President's Address. Do you have a title for the talk? If not, I will
be glad to schedule it simply as "AAAI Presidential Address", as in past
years.
It looks like the time for the address will be pretty much as usual -
most likely it will be Thursday, August, 9, somewhere around 11:00 am,
immediately following some welcoming remarks by Dr. Gerhard Fonken, of
the University of Texas. We will schedule it for approximately one
hour.
Thanks,
Ron B.
-------
The schedule is as expected.
title: What is common sense?
∂30-May-84 0238 @MIT-MC:RWG@SPA-NIMBUS K. Knopf
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 30 May 84 02:38:10 PDT
Received: from SPA-NIMBUS by MIT-OZ via Chaosnet; 30 May 84 05:40-EDT
Received: from SPA-LOS-TRANCOS by SPA-Nimbus with CHAOS; Wed 30-May-84 02:40:45-PDT
Date: Wednesday, 30 May 1984, 02:36-PDT
From: <RWG at SPA-NIMBUS>
Subject: K. Knopf
To: jmc at MIT-OZ
Says he anything on the convergence discriminant
n a[n]/a[log n] ?
(Or 2↑n a[2↑n]/a[n] ?)
∂30-May-84 0802 DLW@SCRC-STONY-BROOK.ARPA GEOMED
Received: from SCRC-STONY-BROOK.ARPA by SU-AI.ARPA with TCP; 30 May 84 08:02:15 PDT
Received: from SCRC-CHICOPEE by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 41473; Wed 30-May-84 11:01:26-EDT
Date: Wed, 30 May 84 11:02 EDT
From: "Daniel L. Weinreb" <DLW@SCRC-QUABBIN.ARPA>
Subject: GEOMED
To: jmc@SU-AI.ARPA
Cc: dlw@SCRC-QUABBIN.ARPA
Message-ID: <840530110200.1.DLW@CHICOPEE.SCRC.Symbolics>
Could you please find out for me where I could find the person who
wrote GEOMED (Baumgart?)? Thank you.
∂30-May-84 0818 DLW@SCRC-STONY-BROOK.ARPA Review
Received: from SCRC-STONY-BROOK.ARPA by SU-AI.ARPA with TCP; 30 May 84 08:18:16 PDT
Received: from SCRC-CHICOPEE by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 41478; Wed 30-May-84 11:05:12-EDT
Date: Wed, 30 May 84 11:05 EDT
From: "Daniel L. Weinreb" <DLW@SCRC-QUABBIN.ARPA>
Subject: Review
To: jmc@SU-AI.ARPA
Cc: dlw@SCRC-QUABBIN.ARPA
Message-ID: <840530110553.3.DLW@CHICOPEE.SCRC.Symbolics>
Would you please send me a copy of your review of Ed Feigenbaum's book
on the Fifth Generation? Thank you.
∂30-May-84 1126 LENAT@SU-SCORE.ARPA AI Qual JUNE 6
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 May 84 11:21:17 PDT
Date: Wed 30 May 84 11:06:35-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: AI Qual JUNE 6
To: tob@SU-AI.ARPA, jmc@SU-AI.ARPA, lenat@SU-SCORE.ARPA, brookS@SU-SCORE.ARPA,
buchanan@SU-SCORE.ARPA
cc: mwalker@SU-SCORE.ARPA
I am currently scheduling the actual committees for next Wednesday.
It looks like each of us will have to be on 3 1-hour committees (I have
changed the length to ne hour, not because we couldn't fill up 90 or 180
minutes, but because I believe we can make a decision in one hour.)
Let me know if there is any time (morning, afternoon) that you would prefer;
I will let you know the times and student names soon (a day or two).
Doug
-------
∂30-May-84 1333 DFH
To: JMC, DFH
Thane Peterson,reporter for BUSINESS WEEK, asks that you call him at 612 332 8577.
∂30-May-84 1334 DFH
To: JMC, DFH
Frank Kemp of USIA called. Will try to call you on Thursday, June 7, when he
gets in town re the filming on Friday afternoon, June 8. Interview of
with Peter Kaiser.
∂30-May-84 1603 Brachman@SRI-KL.ARPA
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 30 May 84 16:03:47 PDT
Date: Wed 30 May 84 08:06:32-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
To: JMC at SU-AI
In-Reply-To: Your message of Tue 29 May 84 23:10:00-PDT
Great. Thanks very much for the quick reply. I will fill you in on
down-to-the-minute timing as soon as it is determined.
Ron
-------
∂30-May-84 1638 ME video synth
∂30-May-84 1619 JMC
Is the video sythesizer broken? xgpsyn hasn't been working for a while.
ME - Yes, the video synthesizer is either gone or permanently disconnected.
It was controlled by the Robotics 11/45, which is now gone. Probably
Robotics took the synthesizer with them.
∂30-May-84 1842 PYLYSHYN@CMU-CS-C.ARPA Frame problem
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 30 May 84 18:42:05 PDT
Received: ID <PYLYSHYN@CMU-CS-C.ARPA>; Wed 30 May 84 21:40:43-EDT
Date: Wed 30 May 84 21:40:42-EDT
From: Zenon <PYLYSHYN@CMU-CS-C.ARPA>
Subject: Frame problem
To: jmc@SU-AI.ARPA
I now have manuscripts from most contributers to the volume on the frame
problem and other holism problems in AI. I await a promised piece from
Hayes, Fodor, and you. Could you get one ready in the next few weeks --
or excise one from one of your papers/books?
The book could use one or two other selections. Do you have any suggestions
for people who might write something interesting (anyone at Stanford?).What hau you been up to...anything you can send me to keep in touch?
-------
∂30-May-84 2234 BOSACK@SU-SCORE.ARPA Re: video synthesizer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 May 84 22:34:12 PDT
Date: Wed 30 May 84 22:22:05-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: video synthesizer
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 30 May 84 22:13:00-PDT
I think we can get it back, likely just by asking. I'll poke at it.
Len
-------
∂31-May-84 0110 HST visit before lisp conference
the paper is ready now and i'll send you a copy.
you know i would give an interesting talk with old pictures.
(Because the paper will be printed then).Are you in stanford in the end of july?
do you believe i could get a room in a student dormitory?
herbert st.
∂31-May-84 0125 @MIT-MC:RWG@MIT-MC easier convergep
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 31 May 84 01:25:18 PDT
Received: from MIT-MC by MIT-OZ via Chaosnet; 31 May 84 04:27-EDT
Date: 31 May 1984 04:26-EDT
From: Bill Gosper <RWG @ MIT-MC>
Subject: easier convergep
To: ES @ MIT-MC, BIL @ MIT-MC, ALAN @ MIT-MC, REM @ MIT-MC, RZ @ MIT-MC,
BMT @ MIT-MC, NJAS @ MIT-MC, dek @ SU-AI, guibas.pa @ XEROX,
ramshaw.pa @ XEROX, jmc @ MIT-OZ
cc: RWG @ MIT-MC, RWW @ MIT-MC, AMO @ MIT-MC, HPM @ MIT-MC
Well, it was too simple to be new. AMO says it's Ermakoff's test, on p. 296 of
Knopp. For any who missed it, if a summand a[n] is eventually monotone, then
the infinite sum converges or diverges as
n a[n]/a[log n]
goes to 0 or infinity with increasing n. If a[log n] doesn't make sense,
you can loo at 2↑n a[2↑n]/a[n] instead. This test decides hypergeometrics,
1/n/(log n)/(loglog n)↑a etc, 1/(loglog n)↑(log n), 1/(log n)↑(loglog n),
1/n↑2↑(1/sqrt(log(n))), e-(1+1/n)↑n, e-(1+1/(n-1/2))↑n,
e↑e↑e↑(n+e↑(-(loglog n)-(log n)-n-e↑n-e↑e↑n) - e↑e↑e↑n, ..., basically
anything you can write in closed form. So why weren't we taught it?
Here are two that are too tough for it:
sum(n↑(n↑2 (sin(n)-1))),
and for positive x,
x + log(1+x) + log(1+log(1+x)) + . . ..
∂31-May-84 0743 GARDNER@SU-SCORE.ARPA Thesis draft
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 May 84 07:32:14 PDT
Date: Thu 31 May 84 07:32:35-PDT
From: Anne Gardner <GARDNER@SU-SCORE.ARPA>
Subject: Thesis draft
To: jmc@SU-AI.ARPA
I'm finally finishing up this quarter. I've put in a few pages about
defeasibility. If you'd like to look at them (with or without the
rest of the thesis), I'd be glad to bring you a copy for comments or
suggestions.
The filing date is next Wednesday, June 6.
--Anne
-------
∂31-May-84 0852 AAAI-OFFICE@SUMEX-AIM.ARPA conference room
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 May 84 08:52:38 PDT
Date: Thu 31 May 84 08:55:13-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: conference room
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
We're planning to get you a VIP parking pass at the University for
the dates of August 4-11. We'll need your car license number
before they issue the pass. Can you ask your secretary to find
this out and send it to me or Barbara Smith (atp.barbara@utexas)
in July? She should be able to get from the car rental company.
Because this pass will allow you to park anywhere on campus,
I've booked you a 1 bedroom suite at the Hyatt for the dates
Aug4-11.
Claudia
-------
∂31-May-84 0900 JMC*
dennis
∂31-May-84 1419 DFH
To: JMC, DFH
Fenaughty of III returned your call.
∂31-May-84 1420 BUCHANAN@SUMEX-AIM.ARPA NO SIGLUNCH THIS FRIDAY
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 May 84 14:19:49 PDT
Date: Thu 31 May 84 14:09:43-PDT
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: NO SIGLUNCH THIS FRIDAY
To: siglunch@SUMEX-AIM.ARPA
Next siglunch is June 8. John McDermott will be here from CMU.
bgb
-------
∂31-May-84 1639 DFH
To: JMC, DFH
Thane Peterson, BUSINESS WEEK reporter called again from Minneaplis. Is
anxious to speak with you about an AI story. Wants your comments on
whether expert systems can learn, commercial possibilities in near term,
shortage of talent in field, etc. 612 332 8577.
∂31-May-84 1958 JJW Terminal
To: JMC, DFH
The DMWAITS terminal and Cermetek modem that I used at home is now in
room 358, for use by someone else this summer. If whoever gets it has
any questions, Yoram should be able to help since he has the same
combination of equipment. I've borrowed a DM terminal and a modem from
Len Bosack to take with me this summer, so that I can keep in touch
(accessing the network through a TAC).
∂31-May-84 2054 reid@Glacier new computers
Received: from SU-GLACIER.ARPA by SU-AI.ARPA with TCP; 31 May 84 20:54:29 PDT
Date: Thu, 31 May 84 20:55:18 pdt
To: JMC@Sail
Subject: new computers
From: Brian Reid <reid@Glacier>
Almost all of the currently-available computers are based on processor
technology of the middle 1970's. The advent of custom VLSI chips and
huge semiconductor memories has radically changed the way that fast
cheap computers should be built. All DEC-20's and all VAXes except the
$5000 MicroVax-2 are built out of discrete components, and organized
around the assumption that there is going to be a lot of off-board
communication in every processor cycle because there isn't much memory
on a board.
Proper use of custom chips requires changes to the architecture to take
advantage of what on-chip processing can do well, so it's not practical
to build a fast implementation of an existing architecture using the
new technology.
For my own part I am quite reluctant to sink any more money right now
computers that will last 5 to 10 years and require maintenance
contracts for 5 to 10 years. DEC, IBM, and various startups are within
a year or two of announcing major new computers built this way.
Brian
∂01-Jun-84 0216 HST visit
the faculty is of course optimal. my plan is last week of july anf first
of august.thank you very much.
∂01-Jun-84 1053 ZM MTC Qual (May 31)
To: MEW@SU-AI.ARPA
CC: JMC@SU-AI.ARPA, MA@SU-AI.ARPA
Martin Abadi -- high pass. Zohar
∂01-Jun-84 1119 HOBBS@SRI-AI.ARPA First Meeting for Commonsense Summer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 Jun 84 11:19:07 PDT
Date: Fri 1 Jun 84 11:16:42-PDT
From: HOBBS@SRI-AI.ARPA
Subject: First Meeting for Commonsense Summer
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@UCB-VAX.ARPA, shoam@YALE.ARPA,
kautz@ROCHESTER.ARPA, jmc@SU-AI.ARPA, dekleer@XEROX.ARPA, brown@XEROX.ARPA,
pat@ROCHESTER.ARPA, james@ROCHESTER.ARPA, mcdermott@YALE.ARPA,
herskovits@UCB-VAX.ARPA
The organizational meeting for Commonsense Summer will be Wednesday, June 6,
at 10am, in room EK242 at SRI. Later today (I hope) I'll send out some
thoughts about what we want to aim for, etc.
-- Jerry
-------
∂01-Jun-84 1354 CLT
1275 blocks $210 times 1.79
∂01-Jun-84 1534 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 1 June 1984
Previous Balance 0.91
Monthly Interest at 1.5% 0.01
Current Charges 0.45 (vending machine)
-------
TOTAL AMOUNT DUE 1.37
Please deliver payments to Fran Larson, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂01-Jun-84 1546 BOSACK@SU-SCORE.ARPA Re: disk charges
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Jun 84 15:40:25 PDT
Date: Fri 1 Jun 84 15:22:57-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: disk charges
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 1 Jun 84 13:50:00-PDT
It looks to me like we charge $0.0293/Kbyte-month (same to 3 sig. dig. on
both). About 3x their prices. However, it's easy to see where they make
their money: CPU costs $40.80/min. The 3081-D is about 6x to 8x the
KL. That gives them an equivalent cost of $6.80 to $5.10 per min vs our
charges of about $1.65 .
Len
-------
∂01-Jun-84 1831 JK
To: JMC, JK, LEP, EXM, JJW
The derive procedure has been modified somewhat:
In particular, you can affect its behaviour by the following
functions:
(der-veryfast); this forces der to consider equalities as simple literals
(der-slow) ; this allows full use of equalities through high
; order unification
(der-fast) ; this allows some simple substitution instances of equalities
; currently the default
decdem[ekl,jk] contains debugging files for some illuminating examples
that tell something about the behaviour of der
to get this kind of information to be printed out, execute the
following setq's:
(setq g:report-time t
g:report-atoms nil
g:report-facts t
g:report-unifiers t
g:report-top-uniflsts nil
g:report-irrelevance t
g:report-cycles t
g:decide-debugging t)
∂02-Jun-84 0328 LENAT@SU-SCORE.ARPA ai qual
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jun 84 03:28:22 PDT
Date: Sat 2 Jun 84 03:27:37-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: ai qual
To: jmc@SU-AI.ARPA
John,
OK, I have scheduled you for qualling from 3-6 pm inclusive on Wednesday.
See you at my MJH office just before 3, for room assignments and such.
Regards,
Doug
-------
∂02-Jun-84 0947 GOLUB@SU-SCORE.ARPA call
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jun 84 09:47:09 PDT
Date: Sat 2 Jun 84 09:46:23-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: call
To: jmc@SU-AI.ARPA
Sorry I was so short with you re:Sjodin. His company will be giving
$5K for his stay. If he works with you, you get $4K in your unrestricted
funds.
Call me at home if you like: 323-0105.
GENE
-------
∂02-Jun-84 1058 LENAT@SU-SCORE.ARPA my tenure case
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jun 84 10:58:08 PDT
Date: Sat 2 Jun 84 10:57:19-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: my tenure case
To: mccarthy@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA
John,
After weighing the possibilities and likelihoods, I still strongly
want the department to appeal the A&P decision. My talk with
Gordon Bower convinced me (and him, I believe) that he had very
incomplete data (or at least that they had overlooked some of it)
concerning my advising, teaching, and research. As I have told Bruce,
I think that if they'ed come back with a specific list of reasons
why they WOULD vote negatively (including those issues, the Gibbons
thing, etc.) it would have been easy to change their minds on most
or all of them. They apparently sent Gene a long letter, but he
hasn't had time yet to read it and talk to me about it (as you might
imagine, I am upset about that, not only because i want to know ASAP,
but because it means I can't even do anything before Tuesday's
tenured faculty meeeting to respond to its contents.)
The final case is one in which the dept appeals and loses, and
even hat is preferable (as far as I'm concerned). It will help
me personally cope with he decision, and I think it will also
help me in getting another job, to know that the faculty backed me
to that extent.
Anyway, thanks for all the effort you've put into this, and I'll
see you Wednesday at the AI Qual.
Regards
Doug
-------
∂02-Jun-84 1140 HOBBS@SRI-AI.ARPA Proposed Overview of Commonsense Summer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 2 Jun 84 11:39:15 PDT
Date: Sat 2 Jun 84 11:39:03-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Proposed Overview of Commonsense Summer
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@UCB-VAX.ARPA, shoham@YALE.ARPA,
kautz@ROCHESTER.ARPA, jmc@SU-AI.ARPA, dekleer@XEROX.ARPA, brown@XEROX.ARPA,
pat@ROCHESTER.ARPA, james@ROCHESTER.ARPA, mcdermott@YALE.ARPA,
herskovits@UCB-VAX.ARPA
COMMONSENSE SUMMER
Aim:
It has long been agreed that if robots are going to be capable of
intelligent behavior, they will need to have a great deal of knowledge
about the commonsense world. But no one has yet embarked on a
large-scale effort to encode this knowledge. The aim of Commonsense
Summer is to do the first three months of such an effort. We will
attempt to axiomatize in formal logic significant amounts of
commonsense knowledge about the physical, psychological and social
worlds. We will concentrate on eight domains: shape and texture,
spatial relationships, the lexical semantics of cause and possession,
properties of materials, certain mental phenomena, communication,
determiners viewed as relations between textual entities and entities
in the world, and responsibility. We will attempt to make these
axiomatizations mutually consistent and mutually supportive.
We will (at least at first) have one large meeting a week to keep
everyone posted on everyone else's progress and problems. There will
also be smaller meetings as appropriate to discuss problems in
particular domains. People interested in the same problems should
make an effort to get together.
Coordinator: Jerry Hobbs
People Participating:
SRI/CSLI Summer Students:
Tom Blenko (Rochester), Communication, June 4 - August 17
Bill Croft (Stanford), Determiners
Marc Dymetman (Grenoble, France), Lexical Semantics
Greg Hager (Pennsylvania), Materials, June 4 - August 31
Henry Kautz (Rochester), Space, June 4 - August 17
Kathleen Kells (Stanford), Responsibility
Paul Kube (Berkeley), Mental Phenomena
Yoav Shoham (Yale), Shape and Texture, June 7 - August 31
SRI/CSLI: Doug Appelt, Steve Barnard, Phil Cohen, Jerry Hobbs,
Kurt Konolige, Bob Moore, Nils Nilsson, Sandy Pentland,
Fernando Pereira, Ray Perrault, Stan Rosenschein, Mark Stickel
Stanford/CSLI: John McCarthy, Johann van Benthem
Xerox PARC: John Seely Brown, Johann de Kleer
Fairchild: Hector Levesque, Andy Witkin
Berkeley: Annette Herskovits, Len Talmy
Rochester: James Allen (June 18-29), Pat Hayes (June 4-22),
Yale: Drew McDermott (June 18-July 13)
Domains:
We will concentrate on the eight domains listed below; a student is
assigned to each. I have given below a characterization of what I see
the domain to be. I have made these up largely without consulting the
students who will be working on them, so there will undoubtedly be
some more or less significant changes, especially as work begins and
problems are encountered. In all of these domains, I have tried to
define target problems, to give us something to shoot for (or at).
I have also tried to set up a healthy tension between robotics
applications and natural language applications. The aim is to achieve
generality by constructing axiomatizations that would be useful for
both.
If there are other domains that other people would like to axiomatize
in a way consistent with these eight axiomatizations, I would certainly
encourage it, although it's not appropriate for me to twist anyone's
arm.
With each domain I've listed papers I recommended to the students to
provide the necessary background and help create a common culture.
The following papers were recommended to all the students.
For an overview of the entire enterprise:
Patrick Hayes, "The Second Naive Physics Manifesto"
Jerry Hobbs, "Introduction" to "Formal Theories of the
Commonsense World"
On the adequacy of logic:
Robert Moore, "The Role of Logic in Knowledge Representation
and Commonsense Reasoning"
Robert Moore, "Problems in Logical Form"
Jerry Hobbs, "The Logical Notation: Ontological Promiscuity"
Shape and Texture: Yoav Shoham
There has been much recent progress in vision research on the
recognition of shapes and textures, and this area is thus ripe for
investigating the relation between vision and language. Possible
target problems:
(1) Have people describe in English half a dozen pictures that vision
researchers have been using as key examples. Encode the knowledge
that will allow one to go from a characterization of the picture that
a present-day visual component could produce to a suitably idealized
version of the English description. It may be that, as Witkin &
Tennenbaum suggest, regularities in images are understood via causal
accounts of what would produce the regularities. Encode the knowledge
that would be required to infer abstract causal explanations of the
image.
(2) Characterize a number of English shape and texture words, such as
"rough", "bumpy", "undulating", "amorphous", etc., in terms of
visual primitives.
Background reading:
Drew McDermott & Ernest Davis, "Planning Routes through
Uncertain Territory"
Alex Pentland, "Fractal-based Description of Natural Scenes"
Alex Pentland, "Local Shading Analysis"
Andrew Witkin, "Scale Space Filtering: A New Approach to
Multi-scale Description"
Andrew Witkin & Jay M. Tenenbaum, "What is Perceptual
Organization For?"
Stephen Barnard, "Interpreting Perspective Images"
Stephen Barnard, "Choosing a Basis for Perceptual Space"
Space: Henry Kautz
The axiomatization of spatial relationships should span the (probably)
Cartesian view of space that a robot would need to move around the
hallways and the more topological view of language that seems to
underlie natural language. The axiomatization should support spatial
metaphor. A possible concrete goal is to encode the knowledge that
would be required by the proposed KLAUS system to understand
descriptions of desired computer graphics displays. Axiomatize time
as a footnote.
Background Reading:
George Miller & Phillip Johnson-Laird, Sections 6.1 ("Spatial
Relations") and 6.2 ("Temporal Relations") in "Language
and Perception" - state of the art as of mid 1970's.
Annette Herskovits, Chapter 3 ("The Three Basic Topological
Prepositions") and 4 ("The Projective Prepositions") in
"Space and the Prepositions in English: Regularities and
Irregularities in a Complex Domain"
Annette Herskovits, "Comprehension and Production of Locatives"
Leonard Talmy, "How Language Structures Space"
(Herskovits and Talmy are the principal recent advances
over Miller & Johnson-Laird.)
Drew McDermott & Ernest Davis, "Planning Routes through
Uncertain Territory" (what a robot would have to know)
Cause, Motion and Perception: Marc Dymetman
George Miller and Phillip Johnson-Laird, in their book "Language and
Perception", have written the (so far) definitive book on lexical
semantics. Their rules for decompositions of verbs can be viewed
as axioms. The problem is to recast their rules into a form that is
consistent with the other axiomatizations being developed for
commonsense summer.
Background Reading:
George Miller & Phillip Johnson-Laird, Sections 6.3 ("Causal
Relations"), 7.1 ("Verbs of Motion"), and 7.2 ("Verbs of
Possession") in "Language and Perception"
Materials: Greg Hager
Consider a variety of materials: metal, wood, concrete, rubber, cloth,
sand, powder, chocolate, water, smoke, air. What states can they be
in and what changes do they undergo when subjected to certain physical
actions, such as motion, deformation, cutting, loss of support. Under
what conditions do they expand or contract, erode, decay, etc.? How
do these properties relate to some of their principal functions. An
extension of Pat Hayes's liquids paper.
Background Reading:
Patrick Hayes, "Naive Physics I: Ontology for Liquids"
Mental Phenomena: Paul Kube
There has been much progress lately in models of belief, desire and
intention. There has also been psychological work on people's metaphors
for the structure of mind. In terms of these two, characterize the
folk view of a number of mental phenomena, such as "remember", "forget",
"suspect", "think of", etc.
Background Reading:
Robert Moore, "A Formal Theory of Knowledge and Action"
Kurt Konolige, "Belief and Incompleteness"
C. Raymond Perrault & James Allen, "A Plan-based Analysis of
Indirect Speech Acts"
George Miller & Phillip Johnson-Laird, Sections 7.3 ("Verbs of
Vision") in "Language and Perception"
Communication: Tom Blenko
Continuation of work by Perrault, Cohen, Allen, Levesque and others
on planning speech acts. Carry this work to one more level of detail.
Axiomatize what the proposed KLAUS system must know about the
communication it will have with the user. Another source of problems
arises in a situation I have devised involving complex interaction in
a simple blocks world, allowing crisp formulations of such acts as
indirect offers, suggestions, tricks, negotiation, etc.
Background Reading:
C. Raymond Perrault & James Allen, "A Plan-based Analysis of
Indirect Speech Acts"
Philip Cohen & Hector Levesque, "Speech Acts and the
Recognition of Shared Plans"
Douglas Appelt, "Planning English Referring Expressions"
Martha Pollack, "Generating Expert Answers through Goal
Inference"
Robert Moore, "A Formal Theory of Knowledge and Action"
George Miller & Phillip Johnson-Laird, Sections 7.4 ("Language
of Communication") in "Language and Perception"
Text and Determiners: Bill Croft
The meanings of many determiners can be characterized as a relation
between linguistic objects, viz. noun phrases, and things in the world.
Axiomatize knowledge about texts and a simple theory of meaning, in
which these relations can be captured. This effort follows up on
previous linguistic work by Bill Croft and is an attempt to cast it
into a logical, AI framework.
Communicative Continuity and Morality: Kathleen Kells
Speech acts iterated over time. How does the fact that communication
will continue affect one's moment-by-moment behavior? This leads
to notions of responsibility, especially the responsibility for the
honesty of one's assertions and the sincerity of one's requests.
This responsibility is the glue that holds social life together.
Leads to problems of characterizing certain aspects of morality.
Background Reading:
Jaime Carbonell, "Computer Models of Human Personality Traits"
C. Raymond Perrault & James Allen, "A Plan-based Analysis of
Indirect Speech Acts"
Philip Cohen & Hector Levesque, "Speech Acts and the
Recognition of Shared Plans"
Interface Problems:
I will be responsible for trying to insure that the various
axiomatizations are mutually consistent and mutually supportive.
My guess is that the interface problems will be localized within
the four physical domains and the four psychosocial domains. For
example, reasoning about where to grasp an irregularly shaped,
rough-textured bowl containing a heap of round objects and moving
it to another location requires knowledge of shapes and textures,
spatial relations, and the behavior of materials. Reasoning about
deception requires knowledge of the other's beliefs, communicative
behavior and sense of responsibility.
In part, coordinating these efforts will involve negotiating interface
predicates between the domains. The theory of materials will need
a containment relation with certain properties, so these properties
must be axiomatized in the theory of spatial relations.
Methodology (Sort Of):
There is no real, known methodology for axiomatizing domains. I have
found three methods useful:
(1) Proceed bottom-up: What is the ontology of the domain? What kinds
of entities are there? What properties do they have? What classes do
they fall into? What relations are there among them? Is there some
set of concepts which seem more "primitive" in terms of which others can
be characterized?
(2) Proceed top-down: Write down in English the facts that seem to be
needed for the class of behaviors or the class of texts of interest.
Gradually refine these statements into rationally arranged predicate
calculus axioms.
(3) Work toward the solution of a target problem, axiomatizing
everything that seems to be required.
The discovery of certain methodological principles for axiomatizing
domains could be one of the most important contributions of Commonsense
Summer.
Monitoring Progress:
I think we need some way of making sure that adequate progress is
being made. One possible mechanism is to have the students write
up a page or so each week about what they've done and where they are.
The first few weeks this might be a clearer formulation of what their
domain is. A bit later it might be statements in English of what the
basic concepts are and the principal facts that must be captured.
Toward the end it should be lists of axioms together with a discussion
of problems the axiomatization doesn't cover. The progress reports
might be viewed as successively expanded and refined drafts of a paper.
The term "progress" should be loosely construed. The discovery of
an unexpected difficulty is progress. The reduction of a page of
axioms to a half page of axioms is progress.
At the end of the summer, we should put together a report with papers
by me, the students, and whoever else wishes to contribute something.
Some Black Holes:
This is a partial list of problems that could easily dominate
discussions for the entire summer. It is hoped these issues will be
avoided or bypassed in some simple manner.
1. Is first-order predicate calculus adequate? Answer: Maybe not,
but let's give it a shot.
2. Notational disputes. Answer: I propose we take a flat,
ontologically promiscuous first-order notation as the lingua franca.
People should then be free to work in any notation they feel
comfortable with, as long as they define translation rules from their
notation to the lingua franca.
3. Before axiomatizing a certain phenomena, a new representation
language has to be devised and implemented. Answer: Not true. This
is the classic waste of time in AI.
4. Semantic disputes. Are there such things as events, actions,
possible worlds, etc.? Is our view of time based on points or
intervals? Answer: Be ontologically promiscuous. Take the union
of the two competing ontologies, and see what the axiomatizations
really need.
5. Definition. Searching for necessary and sufficient conditions
for concepts. Answer: Aim for "characterization", not definition.
We can't expect to discover necessary and sufficient conditions, just
lots of necessary conditions and lots of sufficient conditions.
6. One counterexample refutes a theory. Answer: Theories are not
refuted, only replaced by better theories. One should try to maximize
coverage, settling, where necessary, for axioms that are usually true,
confident that higher processes will plug the holes in the theories.
7. Context-independence. Attempting to characterize concepts in
ways that are independent of the context of use. Answer: Knowledge
will be used in a context-dependent fashion. This assumption allows
us to be loose where being strict would be a black hole. Assume
circumscriptive reasoning is available.
8. Efficiency. Decidability. Answer: For over two decades, AI
researchers have worried about these issues. It won't hurt to ignore
them for three months while we worry about getting the content right.
9. Fuzziness. Uncertainty. Most commonsense concepts are inherently
fuzzy, so a formalism for dealing with fuzzy concepts must first be
adopted or worked out. Answer: Either adopt the idealization that the
world has sharp boundaries or assume a theory of granularity that
maps the world into such an idealized world.
10. Reduction of folk concepts to mathematical structures. For example,
how close is near? Answer: The relation between between folk concepts
and mathematical concepts, e.g., between cognitive topology and
Cartesian space, is in general complex and context-dependent. Relations
between them can be characterized, but the mathematical should not be
taken as primitive.
11. Is there any limit to what we know? Answer: Who cares? Every
little bit of knowledge should still help.
A Gray Hole:
A theory of granularity is needed by every domain. For example, what is
texture at one grain-size is shape at another. At one grain-size, one
can be "at" the post office, while at another one is "in" the post
office "at" the stamp window. The difference between a leak and an
outlet is one of grain-size. This is probably not a problem that can
be sidestepped. One possible solution: Index predicates by grain-size.
-------
∂02-Jun-84 1555 JK
To: JMC, LEP, JK
It struck me that what you want in most examples that you have shown me
so far is rewriting (equality substitution) by cases. This can be done
using the rewrite apparatus "guided" by a universal propositional fact
on distributing disjunctions --- the method is obviously extensible to
many other cases.
Below are a few examples of this including the one that der can't do.
--------------
(wipe-out)
(proof foo)
(derive |∀p q r.((p∨q)⊃r)≡(p⊃r)∧(q⊃r)|)
(label rewrite_by_cases)
(trw
|(E0(A,B)∧(∀X.E0(X,X))∧(∀X Y.E0(X,Y)⊃E0(Y,X))∧(∀X Y Z.E0(X,Y)∧E0(Y,Z)⊃E0(X,Z)))
⊃(X=A∧Y=B∨X=B∧Y=A∨X=Y⊃E0(X,Y))|
(use rewrite_by_cases mode: always))
;E0(A,B)∧(∀X.E0(X,X))∧(∀X Y.E0(X,Y)⊃E0(Y,X))∧(∀X Y Z.E0(X,Y)∧E0(Y,Z)⊃E0(X,Z))⊃
;(X=A∧Y=B∨X=B∧Y=A∨X=Y⊃E0(X,Y))
Here's the symmetry problem with rewritemessages shown
(setq rewritemessages t)
(trw |(X=A∧Y=B∨X=B∧Y=A∨X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X)|
(use rewrite_by_cases mode: always))
;the term X=A∧Y=B∨X=B∧Y=A∨X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X is replaced by:
(X=A∧Y=B⊃Y=A∧X=B∨Y=B∧X=A∨Y=X)∧(X=B∧Y=A∨X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X)
;the term Y is replaced by:
B
;the term X is replaced by:
A
;the term B is replaced by:
A
;the term A=A is replaced by:
TRUE
;the term B=A∧TRUE is replaced by:
B=A
;the term Y=B is replaced by:
TRUE
;the term X=A is replaced by:
TRUE
;the term TRUE∧TRUE is replaced by:
TRUE
;the term B=A∨TRUE∨Y=X is replaced by:
TRUE
;the term X=A∧Y=B⊃TRUE is replaced by:
TRUE
;the term X=B∧Y=A∨X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X is replaced by:
(X=B∧Y=A⊃Y=A∧X=B∨Y=B∧X=A∨Y=X)∧(X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X)
;the term Y=A is replaced by:
TRUE
;the term X=B is replaced by:
TRUE
;the term TRUE∧TRUE is replaced by:
TRUE
;the term TRUE∨Y=B∧X=A∨Y=X is replaced by:
TRUE
;the term X=B∧Y=A⊃TRUE is replaced by:
TRUE
;the term Y is replaced by:
X
;the term X is replaced by:
B
;the term B is replaced by:
A
;the term Y is replaced by:
X
;the term X is replaced by:
A
;the term A=B∧X=A is replaced by:
FALSE
;the term Y=X is replaced by:
TRUE
;the term B=A∧X=A∨FALSE∨TRUE is replaced by:
TRUE
;the term X=Y⊃TRUE is replaced by:
TRUE
;the term TRUE∧TRUE is replaced by:
TRUE
;the term TRUE∧TRUE is replaced by:
TRUE
;X=A∧Y=B∨X=B∧Y=A∨X=Y⊃Y=A∧X=B∨Y=B∧X=A∨Y=X
∂03-Jun-84 1021 JK
∂02-Jun-84 2130 JMC Should this fail? It takes only about 1.5 sec to do so.
(der-fast)
(der |∀p1 p2 p3 q0 q2.
(∀x y.q2(x,y) ≡ p1(x,y) ∨ p2(x,y) ∨ p3(x,y))
∧ (∀x y.p1(x,y) ⊃ q0(x,y))
∧ (∀x y.p2(x,y) ⊃ q0(x,y))
∧ (∀x y.p3(x,y) ⊃ q0(x,y))
⊃ (∀x y.q2(x,y) ⊃ q0(x,y))|)
------------------
Yes - it should: This kind of case splitting it cannot do, since it
occurs inside an equivalence. The above inference is not direct, and
the only kinds of indirect arguments it can handle are those involving
top-level conjunctions or top-level disjunctions on the antecedents of
disjunctions. Instead, try:
(proof foo)
(assume |(∀x y.q2(x,y) ≡ p1(x,y) ∨ p2(x,y) ∨ p3(x,y))|) (label xx)
(der |(∀x y.p1(x,y) ⊃ q0(x,y))∧(∀x y.p2(x,y) ⊃ q0(x,y))∧(∀x y.p3(x,y) ⊃ q0(x,y))
⊃ (q2(x,y) ⊃ q0(x,y))|
()
(use xx mode: always))
∂03-Jun-84 1141 JK bug
I know what the bug is -- this requires some thought.
The verifier in the rewriter can't get hold of this info right now.
Meanwhile, those variables q0 etc are implicitly universal soyou can
do instantiations into them etc as if the line had the quantifiers in it.
∂03-Jun-84 1520 JK
Here's a much better and faster proof:
---------------------------------------
(show)
1. (AXIOM |INDEX(A)=1∧INDEX(B)=2∧INDEX(C)=3∧INDEX(D)=4|)
2. (DERIVE |¬1=2∧¬1=3∧¬2=3∧¬1=4∧¬2=4∧¬2=4| () NIL)
;¬1=2∧¬1=3∧¬2=3∧¬1=4∧¬2=4∧¬2=4
(der-slow)
3. (DERIVE |A≠B| (2 1) NIL)
;A≠B
4. (DEFINE EQUIV
|∀E.EQUIV(E)≡
(∀X.E(X,X))∧(∀X Y.E(X,Y)⊃E(Y,X))∧(∀X Y Z.E(X,Y)∧E(Y,Z)⊃E(X,Z))|
NIL)
5. (DEFINE AX |∀E.AX(E)≡E(A,B)∧EQUIV(E)| NIL)
6. (DEFINE AX1
|∀E.AX1(E)≡
AX(E)∧(∀E1.AX(E1)∧(∀X Y.E1(X,Y)⊃E(X,Y))⊃(∀X Y.E(X,Y)≡E1(X,Y)))|
NIL)
;labels: ASSUMPTION
7. (ASSUME |AX1(E0)|)
(label assumption)
;deps: (ASSUMPTION)
8. (DEFINE E2 |∀X Y.E2(X,Y)≡X=A∧Y=B∨X=B∧Y=A∨X=Y| NIL)
9. (DERIVE |EQUIV(E2)| () ((OPEN EQUIV) (OPEN E2)))
;EQUIV(E2)
;labels: FACT2
10. (DERIVE |AX(E2)| (9) ((OPEN AX) (OPEN E2)))
(label fact2)
;AX(E2)
11. (RW ASSUMPTION (OPEN AX1))
;AX(E0)∧(∀E1.AX(E1)∧(∀X Y.E1(X,Y)⊃E0(X,Y))⊃(∀X Y.E0(X,Y)≡E1(X,Y)))
;deps: (ASSUMPTION)
12. (TRW |AX(E0)| (USE 11))
;AX(E0)
;deps: (ASSUMPTION)
;labels: FACT1
13. (RW 12 (OPEN AX EQUIV))
(label fact1)
;E0(A,B)∧(∀X.E0(X,X))∧(∀X Y.E0(X,Y)⊃E0(Y,X))∧(∀X Y Z.E0(X,Y)∧E0(Y,Z)⊃E0(X,Z))
;deps: (ASSUMPTION)
;labels: REWRITE_BY_CASES
14. (DERIVE |∀P Q R.(P∨Q⊃R)≡(P⊃R)∧(Q⊃R)| () NIL)
(label rewrite_by_cases)
;∀P Q R.(P∨Q⊃R)≡(P⊃R)∧(Q⊃R)
15. (TRW |∀X Y.E2(X,Y)⊃E0(X,Y)|
((OPEN E2) (USE REWRITE_BY_CASES MODE: ALWAYS) (USE FACT1)))
;∀X Y.E2(X,Y)⊃E0(X,Y)
;deps: (ASSUMPTION)
16. (UE ((E0.|E2|)) 11 NIL)
;AX(E0)∧(∀E1.AX(E1)∧(∀X Y.E1(X,Y)⊃E0(X,Y))⊃(∀X Y.E0(X,Y)≡E1(X,Y)))
;deps: (ASSUMPTION)
17. (DERIVE |∀X Y.E0(X,Y)≡E2(X,Y)| (FACT2 16 15) NIL)
;∀X Y.E0(X,Y)≡E2(X,Y)
;deps: (ASSUMPTION)
18. (RW 17 (OPEN E2))
;∀X Y.E0(X,Y)≡X=A∧Y=B∨X=B∧Y=A∨X=Y
;deps: (ASSUMPTION)
∂04-Jun-84 0440 @MIT-MC:RWG@MIT-MC Well, I can always take refuge in batshit
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 4 Jun 84 04:40:50 PDT
Received: from MIT-MC by MIT-OZ via Chaosnet; 4 Jun 84 07:40-EDT
Date: 4 June 1984 07:40-EDT
From: Bill Gosper <RWG @ MIT-MC>
Subject: Well, I can always take refuge in batshit
To: ES @ MIT-MC, REM @ MIT-MC, NJAS @ MIT-MC, AMO @ MIT-MC,
BMT @ MIT-MC, RZ @ MIT-MC, BIL @ MIT-MC, ALAN @ MIT-MC, dek @ SU-AI,
guibas.pa @ XEROX, jmc @ MIT-OZ, mlb @ SCRC-STONY-BROOK
cc: RWG @ MIT-MC
44 sin n pi/89 1
Prod ----------- = 1000 + ------------
n=1 2 1
sin n pi/89 1000 + ----------
. . ..
∂04-Jun-84 0500 @COLUMBIA-20.ARPA:STAFF.HERSHMAN@NYU20 nyc macsyma
Received: from COLUMBIA-20.ARPA by SU-AI.ARPA with TCP; 4 Jun 84 04:58:20 PDT
Received: from NYU20 by CUCS20 with DECnet; 4 Jun 84 07:58:15 EDT
Date: 4 Jun 1984 07:58 EDT (Mon)
Message-ID: <STAFF.HERSHMAN.12020743859.BABYL@NYU20>
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
To: Bill Gosper <rwg@MIT-MC>
Cc: cwh@MIT-MC, JMC@SU-AI, Ittai@MIT-MC
Reply-to: Ittai@MIT-MC
Subject: nyc macsyma
In-reply-to: Msg of 26 Apr 1984 07:58 EST (Thu) from Ittai Hershman <STAFF.HERSHMAN@NYU20>
Date: 26 Apr 1984 07:58 EST (Thu)
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
To: Bill Gosper <rwg@MIT-MC>
Date: Thursday, 26 April 1984, 01:05-PST
From: Bill Gosper <rwg at SPA-NIMBUS>
To: cwh.ih at MIT-OZ
cc: JMC at SU-AI, cwh at SPA-NIMBUS
Re: nyc macsyma
I met two remarkable mathematicians (David and Gregory Chudnovsky) from
Columbia during the recent NYU computer algebra conference, and have
since learned that they do not use Macsyma. CWH says you might know
of a Macsyma installation thereabouts which they could try out. Any
suggestions will be much appreciated, as this might be like replacing
Beethoven's Broadwood with a Bosendorfer.
Hmmm. I'll have to look into it. I suspect that one of Columbia's
vaxen must be running Macsyma-- I'll ask and get back to you...
-Ittai
Upon returning from my vacation this week, I found a response from the
Columbia Vaxen manager, that they do not have, nor plan on getting
MACSYMA. The only other place to try is Courant, and you probably have
the contacts there to initiate a request for the Columbia people to use
MACSYMA on their machines.
Sorry I couldn't be of more help,
-Ittai
∂04-Jun-84 0910 JK
try the following as your last step:
15. (TRW |E2(X,Y)⊃E0(X,Y)|
((OPEN E2) (USE REWRITE_BY_CASES MODE: ALWAYS) (USE FACT1)))
EKL currently prefers bound variables to non-bound ones when rewriting, so
in
;(∀X Y.(X=A∧Y=B⊃E0(X,Y))∧(X=B∧Y=A⊃E0(X,Y)))
equality substitutions were not made.
∂04-Jun-84 0930 JMC*
livermore
∂04-Jun-84 1030 JMC*
Agerwala
∂04-Jun-84 1215 Brachman@SRI-KL.ARPA Sticky situation
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 4 Jun 84 12:15:35 PDT
Date: Fri 1 Jun 84 16:43:38-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
Subject: Sticky situation
To: JMC at SU-AI
John,
I am faced with a dilemma, and would really like some good advice. This
year the AAAI Program Committee decided not to award a single
Publisher's Prize for the "best paper" at the conference, but to instead
share the prize among a number of the better papers (it's too hard to
compare them well). Most of the people have voted on the papers, and we
have isolated a group of four, maybe five, papers that the PC deemed
best. The sticky problem is this: one of those papers is mine
(co-authored with Hector Levesque, who has a paper of his own also in
the elite set, which further complicates matters)). I think that even
with sharing the prize among a group, I should probably disqualify my
paper from consideration. I could disqualify it completely, and no one
will ever know. Or, it could perhaps be designated as an "outstanding
paper" or some such, but receive no part of the prize. Also this year
we are highlighting the best papers at a special plenary session - I
could imagine simply choosing not to highlight my own paper, but still
having it considered a prize-winner. Or some combination of things. Do
you have any thoughts on what is appropriate in this situation?
Thanks for any advice you can give,
Ron
-------
∂04-Jun-84 1553 SCHREIBER@SU-SCORE.ARPA Meeting tomorrow
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 84 15:53:31 PDT
Date: Mon 4 Jun 84 15:51:17-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
Subject: Meeting tomorrow
To: schreiber@SU-SCORE.ARPA, tob@SU-AI.ARPA, dek@SU-AI.ARPA, phy@SU-AI.ARPA,
foulser@SU-SCORE.ARPA, ma@SU-AI.ARPA, papa@SU-SCORE.ARPA,
worley@SU-NAVAJO.ARPA, tracy@SU-SCORE.ARPA, bothner@SU-SCORE.ARPA,
lantz@SU-AIMVAX.ARPA, stefan@SU-SCORE.ARPA, kateveni@SU-SHASTA.ARPA,
lamping@SU-SCORE.ARPA, jmc@SU-AI.ARPA, zauderer@SU-SCORE.ARPA,
mwalker@SU-SCORE.ARPA
to discuss changes to
a. reading list (in AI)
b. split of committee (programming/written),
c. rules for who may take the exam,
d. everything (john's proposal),
and to recomsider the cases of Li-Mei Wu and Elizabeth Hurd.
Rob
-------
∂04-Jun-84 1617 GEORGEFF@SRI-AI.ARPA Concurrency/Planning workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 4 Jun 84 16:16:59 PDT
Date: Mon 4 Jun 84 16:18:50-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Concurrency/Planning workshop
To: JMC@SU-AI.ARPA
John,
I thought I might produce a few example problems to focus some of the
discussion at the concurrency/planning workshop i.e., that would extend
the work in formal computer science methods (temporal logics, only
action is the assignment operator, etc.) and the work in AI (non-conditional
plans, no loops, etc.). Any ideas on suitable problems, e.g., extended
blocks world, incomplete information, etc?
Mike.
-------
∂05-Jun-84 0000 JMC*
Dun Whit for The Russians.
∂05-Jun-84 0822 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - June 8, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 08:22:38 PDT
Date: Tue 5 Jun 84 08:22:22-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - June 8, 1984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, June 8, 1984
LOCATION: Chemistry Gazebo, between Organic & Physical Chemistry
TIME: 12:05
SPEAKER: John McDermott
Carnegie-Mellon University
TOPIC: How Configurers Might Acquire Knowledge
ABSTRACT: This talk will focus on the changes that have been made
to R1's knowledge over the past four years. Using that
data as a guide, Dr. McDermott will then discuss what
problems need to be confronted in order to automate
the acquisition of configuration knowledge.
-------
∂05-Jun-84 1005 GEORGEFF@SRI-AI.ARPA Concurrency/Planning Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 10:05:01 PDT
Date: Tue 5 Jun 84 10:01:27-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Concurrency/Planning Workshop
To: lamport@SRI-CSL.ARPA, pratt@SU-AI.ARPA, jmc@SU-AI.ARPA,
waldinger@SRI-AI.ARPA, stan@SRI-AI.ARPA, goguen@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, Edmund.Clarke@CMU-CS-A.ARPA,
BARWISE@SU-CSLI.ARPA, wol@SU-AI.ARPA, MISRA@SU-SIERRA.ARPA,
james@ROCHESTER.ARPA, HALPERN%ibm-sj.csnet@CSNET-RELAY.ARPA,
lansky@SRI-CSL.ARPA, pereira@SRI-AI.ARPA, georgeff@SRI-AI.ARPA
This is just an update on the Concurrency/Planning workshop to take
place August 22-24, 1984.
The workshop is to be held at Monterey Dunes (a holiday resort just
outside Monterey). It is intended that it start at lunchtime on the
22nd and finish at 5pm on the 24th. Accomodation is booked for all
participants for the nights of the 22nd and 23rd. If anyone wishes to
stay over on the night of the 24th, or wants accomodation in the Bay
area for that night, please let me know and I will arrange that also.
All major travel, accomodation and food costs will be covered by the
workshop organizers. The workshop is being sponsored by the American
Association for Artificial Intelligence and the Center for the Study
of Language and Information.
I will write you a more formal letter in the next week or so, giving
more details. In the meantime, if you have any queries, requests,
ideas, etc., please don't hesitate to let me know.
I look forward to seeing you at the workshop.
Michael Georgeff.
-------
∂05-Jun-84 1147 DFH
To: JMC, DFH
Dr. Huntsinger from Cal State Chico called. Will call back.
∂05-Jun-84 1149 DFH
To: JMC, DFH
Dr. Jastrow called.
∂05-Jun-84 1149 DFH
To: JMC, DFH
Kurt Konolige called. He wants to get his thesis signed today. Pls. send him
message on computer to let him know what time he may come by this afternoon
for your signature.
∂05-Jun-84 1346 wouk@BRL-VGR.ARPA
Received: from BRL-VGR.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 13:46:35 PDT
Date: Tue, 5 Jun 84 16:22:15 EDT
From: wouk@BRL-VGR.ARPA
Sender: wouk@BRL-VGR.ARPA
To: JMC@su-ai.ARPA
On a recent visit to Ft. Monmouth I was told a problem by Leon
Kotin that he said he got from you. I in turn told the problem
to my wife's uncle who is a retired mathematician, and he got in-
volved, and is now pestering me about the solvability.
The following is my understanding of the problem: it concerns the
product and sum of two integers, each between 2 and 99. The pro-
duct is given to P, the sum to S, after which P states that he
doesn't know the numbers. S in turn states that he doesn't know
the numbers, but that he knew that P couldn't know the numbers
before P said so. P then announces that he knows the two
numbers.
Have I stated the problem correctly? If so, is the correct answer
that P is wrong? Please get me out from under. I was just trying
to entertain an old man, but I have gotten in over my head with
him. I don't have the time to spend on it myself, so would appre-
ciate any reference which I could pass on.
Arthur Wouk
wouk@brl-vgr
919-549-0641
∂05-Jun-84 1356 KONOLIGE@SRI-AI.ARPA signature
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 13:55:50 PDT
Date: Tue 5 Jun 84 13:57:34-PDT
From: Kurt Konolige <Konolige@SRI-AI.ARPA>
Subject: signature
To: jmc@SU-AI.ARPA
John, will you be in sometime this afternoon, so that I can
collect a signature? --kk
-------
I will be in, but I will first have to check that I am satisfied with
the final version.
∂05-Jun-84 1403 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 14:02:47 PDT
Date: Tue 5 Jun 84 14:00:01-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: lamping@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA
Who publishes Rich's book? I need to know now, please.
Rob
-------
McGraw-Hill I think.
∂05-Jun-84 1430 SCHREIBER@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jun 84 14:30:02 PDT
Date: Tue 5 Jun 84 14:27:57-PDT
From: Robert Schreiber <SCHREIBER@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 5 Jun 84 14:27:00-PDT
Thanks
Rob
-------
∂05-Jun-84 1441 DFH
To: JMC, DFH
I have put your ticket to Austin (Aug. 5) in current file in your desk.
Caroline has the two tickets to Paris (June 23).
∂05-Jun-84 1443 DFH
To: JMC, DFH
Ticket to Atlants(June 9) also in Current file.
∂05-Jun-84 1519 DFH
To: JMC, DFH
John Xenokis, former student, asks that you grant him a 10 minute phone
interview for an article he is writing on AI. Will call again later
this afternoon, but if he misses you, he would appreciate a call at
6l7 875 4266.
∂06-Jun-84 0052 HST some addresses
could you be so kind and give me r.silvers address?
and please remind me of d.edwards address (in that fort meade...)
∂06-Jun-84 0136 @MIT-MC:RWG@MIT-MC chudnovskys
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 6 Jun 84 01:36:10 PDT
Received: from MIT-MC by MIT-OZ via Chaosnet; 6 Jun 84 04:36-EDT
Date: 6 June 1984 04:38-EDT
From: Bill Gosper <RWG @ MIT-MC>
Subject: chudnovskys
To: jmc @ MIT-OZ
Received: from NYU20 by CUCS20 with DECnet; 4 Jun 84 07:58:15 EDT
Date: 4 Jun 1984 07:58 EDT (Mon)
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
Reply-to: Ittai@MIT-MC
In-reply-to: Msg of 26 Apr 1984 07:58 EST (Thu) from Ittai Hershman <STAFF.HERSHMAN@NYU20>
Date: 26 Apr 1984 07:58 EST (Thu)
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
To: Bill Gosper <rwg@MIT-MC>
Date: Thursday, 26 April 1984, 01:05-PST
From: Bill Gosper <rwg at SPA-NIMBUS>
To: cwh.ih at MIT-OZ
cc: JMC at SU-AI, cwh at SPA-NIMBUS
Re: nyc macsyma
I met two remarkable mathematicians (David and Gregory Chudnovsky) from
Columbia during the recent NYU computer algebra conference, and have
since learned that they do not use Macsyma. CWH says you might know
of a Macsyma installation thereabouts which they could try out. Any
suggestions will be much appreciated, as this might be like replacing
Beethoven's Broadwood with a Bosendorfer.
Hmmm. I'll have to look into it. I suspect that one of Columbia's
vaxen must be running Macsyma-- I'll ask and get back to you...
-Ittai
Upon returning from my vacation this week, I found a response from the
Columbia Vaxen manager, that they do not have, nor plan on getting
MACSYMA. The only other place to try is Courant, and you probably have
the contacts there to initiate a request for the Columbia people to use
MACSYMA on their machines.
Sorry I couldn't be of more help,
-Ittai
Haven't they already tried this? If not, I'll ask Ittai for contact names,
which I, in fact, lack..
∂06-Jun-84 0911 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Jun 84 09:10:55 PDT
Date: Wed 6 Jun 84 09:12:20-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@SRI-AI.ARPA, shoham@YALE.ARPA,
kautz@SRI-AI.ARPA, hager@SRI-AI.ARPA, jmc@SU-AI.ARPA, dekleer@XEROX.ARPA,
brown@XEROX.ARPA, pat@ROCHESTER.ARPA, james@ROCHESTER.ARPA,
mcdermott@YALE.ARPA, kim.hersk@UCB-VAX.ARPA, levesque@SRI-KL.ARPA,
witkin@SRI-KL.ARPA, lep@SU-AI.ARPA, grosof@SU-AI.ARPA, johan@SU-CSLI.ARPA
The first meeting of Commonsense Summer will be today at SRI at 10 am,
in EK242.
-- Jerry
-------
∂06-Jun-84 0945 TAJNAI@SU-SCORE.ARPA Recommendation for Yonnie Malachi
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Jun 84 09:45:43 PDT
Date: Wed 6 Jun 84 09:44:44-PDT
From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: Recommendation for Yonnie Malachi
To: ZM@SU-AI.ARPA, JMC@SU-AI.ARPA, RJW@SU-AI.ARPA
Yonnie will be interviewing at Shell Development on June 22.
Dr. Carl Smith would appreciate your calling him PRIOR to June 22.
Call collect
713/663-2388
Thanks,
Carolyn
-------
∂06-Jun-84 1625 HOBBS@SRI-AI.ARPA Coming meetings
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Jun 84 16:25:38 PDT
Date: Wed 6 Jun 84 16:26:40-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Coming meetings
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@SRI-AI.ARPA, shoham@YALE.ARPA,
kautz@SRI-AI.ARPA, hager@SRI-AI.ARPA, laws@SRI-AI.ARPA, jmc@SU-AI.ARPA,
dekleer@XEROX.ARPA, brown@XEROX.ARPA, pat@ROCHESTER.ARPA,
james@ROCHESTER.ARPA, mcdermott@YALE.ARPA, kim.hersk@UCB-VAX.ARPA,
levesque@SRI-KL.ARPA, witkin@SRI-KL.ARPA, lep@SU-AI.ARPA, grosof@SU-AI.ARPA,
johan@SU-CSLI.ARPA
John McCarthy will talk about the blocks world on Friday, June 8, at 1:30 pm,
in EK242 at SRI.
People interested in commonsense psychology, including the domains of
mental phenomena, communication and responsibility, should come to a meeting
on Friday, June 8, at 4 pm in EJ222 at SRI.
-- Jerry
-------
∂06-Jun-84 2352 LENAT@SU-SCORE.ARPA AI Qual
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Jun 84 23:52:41 PDT
Date: Wed 6 Jun 84 23:50:59-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: AI Qual
To: mwalker@SU-SCORE.ARPA, buchanan@SU-SCORE.ARPA, brooks@SU-SCORE.ARPA,
clancey@SUMEX-AIM.ARPA, tob@SU-AI.ARPA, levesque@SRI-KL.ARPA,
perrault@SRI-KL.ARPA, mccarthy@SU-SCORE.ARPA
cc: lenat@SU-SCORE.ARPA
Thank you all for helping make the AI Qual go so smoothly.
Results:
Schieber pass
Devika Subramanian conditional pass (TA 229 next winter: AI Qual Prep)
Lamping failure (but sent an encouraging note)
Holstege failure (but sent a guardedly encouraging note)
Karp pass
Grosof pass (but sent an admonition not to bluff, and to read TW's book)
Ashok Subramanian Pass
Ruthman failure
Hsu pass
Please contact me if I appear to have made any errors, or if you have
suggestions for next year's administering of the Qual. Once again, THANKS!
Regards,
Doug
-------
∂07-Jun-84 0900 JMC*
Selfridge, Dennett, Fredkin
∂07-Jun-84 1341 @USC-ECL.ARPA:FIKES@ECLD Publisher's Prize
Received: from USC-ECL.ARPA by SU-AI.ARPA with TCP; 7 Jun 84 13:41:43 PDT
Received: from ECLD by ECLA with ECLnet; Thu 7 Jun 84 13:40:35-PDT
Date: Thu 7 Jun 84 13:40:19-PDT
From: Richard Fikes <FIKES%λECLD@ECLAλ>
Subject: Publisher's Prize
To: jmc@SU-AI.ARPA
cc: FIKES@ECLD.#ECLnet
John,
We need to talk asap about how to proceed with the Publisher's
Prize selection. Please call me either at work (853-5557) or at
home (328-8524).
richard
-------
∂07-Jun-84 1450 DFH
To: JMC, DFH
Dr. Jastrow called. Left his number - 603 646 3361
∂07-Jun-84 1451 DFH
To: JMC, DFH
Richard Fikes, AAAI Treasurer, called. Seemed extremely anxious to speak
with you. 853 5557
∂07-Jun-84 1549 DFH Re Gosper, Visiting Scholar
To: JMC, DFH
Is he to be paid? What quarters will be be here, please?
No pay, no quarters. I just want to give him an account and library privileges.
∂07-Jun-84 1714 GROSOF@SU-SCORE.ARPA knowledge seminar tomorrow.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Jun 84 17:14:12 PDT
Date: Thu 7 Jun 84 17:13:20-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: knowledge seminar tomorrow.
To: jmc@SU-AI.ARPA
Hi John,
Well, I've surfaced from qual immersion, even successfully! I'm planning to
go to the knowledge seminar at IBM tomorrow, and to go to your talk at SRI
related to commono sense summer at 1:30. Would you like to go to IBM together?
If so, please call me at home this evening at 424-8078. If I'm out just leave
a message on my machine. I'll be getting back to working on circ'n very soon.
Regards,
Benjamin
-------
∂07-Jun-84 2110 BOSACK@SU-SCORE.ARPA Re: foonly
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Jun 84 21:10:39 PDT
Date: Thu 7 Jun 84 21:09:48-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: foonly
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 7 Jun 84 18:55:00-PDT
Have you gotten any interesting responses from your query about people's
needs for large machines?
If you will be in tomorrow, I'll stop by.
Len
-------
∂08-Jun-84 0938 DFH
To: JMC, DFH
Richard Fikes called again this morning. His number is 853 5557. Still
anxious to speak with you.
∂08-Jun-84 1018 DFH
To: JMC, DFH
Please call your daughter, Susan.
∂08-Jun-84 1111 HOBBS@SRI-AI.ARPA Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Jun 84 11:10:58 PDT
Delivery-Notice: While sending this message to SU-AI.ARPA, the
SRI-AI.ARPA mailer was obliged to send this message in 50-byte
individually Pushed segments because normal TCP stream transmission
timed out. This probably indicates a problem with the receiving TCP
or SMTP server. See your site's software support if you have any questions.
Date: Fri 8 Jun 84 11:05:31-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Reminder
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@SRI-AI.ARPA, shoham@YALE.ARPA,
kautz@SRI-AI.ARPA, hager@SRI-AI.ARPA, laws@SRI-AI.ARPA, hanson@SRI-AI.ARPA,
jmc@SU-AI.ARPA, dekleer@XEROX.ARPA, brown@XEROX.ARPA, pat@ROCHESTER.ARPA,
james@ROCHESTER.ARPA, mcdermott@YALE.ARPA, kim.hersk@UCB-VAX.ARPA,
levesque@SRI-KL.ARPA, witkin@SRI-KL.ARPA, pack@SRI-AI.ARPA,
grosof@SU-AI.ARPA, johannes@SU-CSLI.ARPA, deanna@SU-CSLI.ARPA
John McCarthy will talk about the blocks world this afternoon at 1:30 in
EK242 at SRI.
People interested in commonsense psychology, including the domains of
mental phenomena, communication and responsibility, should come to a
meeting this afternoon at 4 in EJ222 at SRI. We may start a little
late since Ed Ashcroft is serving champagne at 4.
-- Jerry
-------
∂08-Jun-84 1513 minker@umcp-cs.arpa LOGIC and AI
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 8 Jun 84 15:12:58 PDT
Received: From umcp-cs.csnet by csnet-relay; 8 Jun 84 17:52 EDT
Date: 8 Jun 84 17:09:15 EDT (Fri)
From: JACK MINKER <minker@umcp-cs.arpa>
Subject: LOGIC and AI
To: Reiter%ubc.csnet@csnet-relay.arpa, JMC@su-ai.arpa, henschen@anl-mcs.arpa,
decvax!watmath!mavanemden@ucb-vax.arpa,
BARWISE%su-csli.arpa@csnet-relay.csnet
Cc: perlis@umcp-cs.arpa, egkle@umcp-cs.arpa
We are starting to think about how to best achieve a
productive week for your visit at Maryland in October. When
we originally discussed the week, it was stated that each
individual would present two lectures. In thinking further
about this, Don and I are not sure that such a heavy diet of
lectures would be the best strategy since it would not leave
adequate time to discuss technical issues on a more informal
basis.
What we would suggest is one lecture per person, and a
schedule as follows:
9-11AM Free time for individual discussions.
11-12AM Lecture (Open to the Public)
12-2 Lunch
2-4 Informal meeting with all participants (exclud-
ing the public-unless someone comes who we
believe can contribute to the discussions).
4-5 Free time for individual discussions or to con-
tinue the informal meeting.
We would like your reaction to the above schedule. In
addition, we need to know the title of the lecture(s) that
you plan and a preferred date for your lecture(s). We would
appreciate receiving this information this month. We assume
that you will be here for the entire week unless you tell us
otherwise. Coordinating now will give us an opportunity to
αhave the schedule worked out to everyone's satisfaction.
You will be provided office space in the Mathematics
Building. If we need a large room for all of us to work
together, we can undoubtedly obtain such a room, or we can
move to my room in the Computer Science Department.
We have applied for a grant from the NSF to be able to
support junior faculty and students who may wish to attend
for the entire week or part of the week. There is reason to
believe that we will obtain some funding. An announcement
is being sent over the "Net" to the artificial intelligence
community. I am appending the annoucement below.
In addition, I am enclosing a description of what we
expect to accomplish that was sent to the NSF. Whether we
can achieve all of our objectives, or any fraction thereof
depends upon how we allocate our time. We are looking for-
ward to a productive week.
The following is material that we sent to the NSF.
Logic and its Role in Artificial Intelligence
!
One week will be devoted to the topic of logic and its
role in artificial intelligence. There are a number of
issues that we expect to discuss. These deal with the
topics of non-monotonic reasoning, belief and language,
logic programming, theorem proving and databases. The indi-
viduals invited to participate in this week's sessions all
have backgounds in at least one of these areas.
A number of important issues should be discussed
between the participants in addition to their formal lec-
tures. In the area of non-monotonic reasoning, it will be
of interest to discuss the extent to which McCarthy's con-
cept of circumscription actually solves the problem of being
able to circumscribe on a predicate. In this context, Davis
has shown that there are difficulties with infinite
universes and circumscritpion. We expect to explore the
possible use of infinitary logic here.
We are also interested in the problem of computing
effectively in the presence of non-monotonicity. This prob-
lem also relates to logic programming in which one has non-
monotonicity in the form of "negation as failure". In the
context of Horn databases, Reiter's closed world assumption
plays an important role in computing negations. Although
logic programming has this non-monotonic feature, it cannot
handle what Minker and Perlis refer to as "protected cir-
cumscription", a generalization of circumscription. Non-
monotonicity also relates to the database problem. How does
one compute answers to queries in the presence of indefinite
data and non-monotonicity? Minker's generalized closed
world assumption specifies how one can compute answers with
this concept of non-monotonicity. However, it is a very
inefficient mechanism when one has a deductive database. It
will be of interest to discuss the approach by Henschen in
this context. We are also interested in how to modify logic
programs to handle "generalized closed world assumptions"
and other types of data. We recognize that it may not be
possible to make efficient modifications and may have to
resort to theorem proving. One might then inquire as to
inference systems that might easily be used to extend the
Horn theorem prover, LUSH resolution, underlying logic pro-
gram languages. In theorem proving we are interested in how
knowledge may be incorporated into theorem provers to make
them into viable tools.
Language and belief are fundamental to artificial
intelligence problems. We shall inquire into the role that
logic plays in this area. How can the belief that one indi-
vidual has in the belief of another individual be
represented and manipulated using logic? What does it mean
!
for a belief to be true?
Recent work in natural language has shown that logic
programming is a useful tool for parsing natural language
grammars. In addition, Reiter has shown how anaphora may by
handled in logic. How can other issues in language be han-
dled through logic? To what extent are traditional logics
inadequate for this task? The work by Barwise in language
will permit us to focus on some of the crucial issues in
this area.
The above represent some topics that we expect to dis-
cuss in th course of the week. We realize that these topics
cannot all be covered, but even if some insight is shed into
some of them, or research directions are influenced by the
discussions, the week will have been well spent.
The announcement sent out over the "Net" is as follows:
SPECIAL YEAR
IN
MATHEMATICAL LOGIC
AND
THEORETICAL COMPUTER SCIENCE
Each year the Mathematics Department of the University
of Maryland devotes its attention to a special topic. In
conjunction with the Department of Computer Science, the
1984-1985 academic year will be devoted to the topic of
mathematical logic and theoretical computer science. The
year will consist of eight sessions devoted to particular
areas. The time-table that has evolved is given below.
As will be noted, the week of October 22-26, 1984, will
be devoted to issues in LOGIC and its ROLE in ARTIFICIAL
INTELLIGENCE with emphasis on knowledge representation, com-
mon sense reasoning, non-monotonic reasoning and logic pro-
gramming.
The lectures will be open to the public. The precise
times and dates of the lectures for the AI week will be
announced in the next few months.
!
We anticipate that there will be modest financial sup-
port presumably for graduate students and junior faculty.
Applications for support for the week of October 22-26 to be
devoted to LOGIC and its ROLE in ARTIFICIAL INTELLIGENCE
should be sent to:
Dr. Jack Minker
Department of Computer Science
University of Maryland
College Park, Maryland
20742
minker@umcp-cs
(301) 454-6119
Kindly send a letter including a vitae, a statement as to
the importance of these issues to your research, the number
of days you might like to attend, and the amount of support
that you might require. We emphasize that we do not know if
we will have funds and even assuming they are available,
they will be modest at best. You should also notify the
above by sending a message over the net expressing your
interest in attending the open sessions.
Those who plan to come, but require no financial sup-
port should also inform us of your intentions so that we may
arrange for an appropriate size lecture hall.
Those individuals interested in other topics associated
with this Math Year should contact:
Dr. E.G.K. Lopez - Escobar
Department of Mathematics
University of Maryland
College Park, Maryland
20742
egkle@umcp-cs
(301) 454-3759
and provide the same information as above.
!
TIME SCHEDULE
AND
LECTURERS
October 1-5, 1984. Semantics and Logics of Programs.
Participants:
S. Brookes, D. Kozen, A. Meyer, M. O'Donnell, R.
Statman
October 8-12, 1984. Recursion Theory.
Participants:
R. Book, J. Case, R. Daley, D. Leivant, J. Myhill, A.
Selman, P. Young
**October 22-26, 1984. LOGIC and its ROLE in ARTIFI-
CIAL INTELLIGENCE
Participants:
J. Barwise, M. van Emden, L. Henschen, J. McCarthy,
R. Reiter
December 3-7, 1984. Model Theory and Algebra.
Participants:
A. Macintyre, A. Mekler, C. Wood
March 4-8, 1985. Automath and Automating Natural
Deduction.
Participants:
N.G. DeBruijn, J. Zucker
March 11-15, 1985. Stability theory.
Participants:
J. Baldwin, S. Buechler, A. Pillay, C. Steinhorn
April 22-26, 1985. Toposes and Model Theory.
Participants:
A. Joyal, F. Lawvere, I. Moerdijk, G. Reyes, A. Scen-
drov
April 29-May 3,1985. Toposes and Proof Theory.
Participants:
M. Bunge, P. Freyd, M. Makkai, D. Scott, P. Scott
!
∂08-Jun-84 1644 RPG@S1-A.ARPA
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 8 Jun 84 16:44:03 PDT
Date: 08 Jun 84 1640 PDT
From: Dick Gabriel <RPG@S1-A.ARPA>
To: jmc@SU-AI.ARPA
We decided not to meet for dinner.
∂10-Jun-84 0044 LLW@S1-A.ARPA Citizenship Info
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 10 Jun 84 00:44:16 PDT
Date: 10 Jun 84 0040 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Citizenship Info
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA, GAP@S1-A.ARPA
∂08-Jun-84 1823 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 8 Jun 84 18:23:29 PDT
Date: 08 Jun 84 1826 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
To: llw@S1-A.ARPA
The Chudnovskys are U.S. citizens as of last Fall.
[John: Thanks for the (highly welcome) information! Lowell]
∂10-Jun-84 0055 LLW@S1-A.ARPA Reactionary Journal
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 10 Jun 84 00:55:22 PDT
Date: 10 Jun 84 0051 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Reactionary Journal
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
[John: Looks eminently deserving of every reasonable person's support.
I'll do whatever I can (extending at least to contributing on those
few subjects with which I'm familiar. Lowell]
∂08-Jun-84 0134 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 8 Jun 84 01:34:38 PDT
Date: 08 Jun 84 0135 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
To: llw@S1-A.ARPA
∂10-Jun-84 0936 pratt@Navajo
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 10 Jun 84 09:36:39 PDT
Date: Sun, 10 Jun 84 09:35:46 pdt
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: faculty@SU-SCORE.ARPA, library@SU-SCORE.ARPA
In-Reply-To: Your message of 08 Jun 84 2244 PDT.
From: Vaughan Pratt <pratt@Navajo>
jmc - Arthur, since our library has gone into hopeless chicken shit
mode, it is not worthwhile to comment about trivia.
I think you've gone into hopeless defeatist mode, John. Whether or not the
library succeeds in optimizing and modernizing itself to everyone's
satisfaction, it does provide an outstanding basic service.
What would you say are the improvements the library most badly needs?
-v
∂10-Jun-84 1000 JMC*
nonmon to Gavan Duffy
∂10-Jun-84 1421 MULLER@SU-SCORE.ARPA Scott paper
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jun 84 14:21:52 PDT
Date: Sun 10 Jun 84 14:20:57-PDT
From: Eric Muller <MULLER@SU-SCORE.ARPA>
Subject: Scott paper
To: jmc@SU-AI.ARPA
is entitled "Lectures on a mathematical theory of computation" and
is in :
Broy, M. and Schmidt, G. (Editors)
Theoritical fundations of Programming Methodology.
Lecture notes of an International Summer School,
directed by Bauer, Dijkstra and Hoare.
D. Reidel Publishing Company, 1982
Library of congress : QA 76.6.T446
ISBN 90-277-1462-2
on pages 145 to 292. This book in the math library now. It is followed
by "Semantic Models" by J.E. Stoy.
Eric Muller.
-------
∂11-Jun-84 1033 DFH
To: JMC, DFH
Please call Newton Hawley in Math Dept. 7-208l.
∂11-Jun-84 1302 CLT
sat 23 jun PA72 lv SFO 9am arr JFK 5:10pm
sat 23 jun PA114 lv JFK 6:45pm arr Orly 8:00am
sun 1 jul AF806 lv deG 9:00am arr Heathrow 9:00am
sun 1 jul PA125 lv Hea 12:45pam arrSFOw3935pam
∂11-Jun-84 1533 HOBBS@SRI-AI.ARPA Meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 11 Jun 84 15:33:41 PDT
Date: Mon 11 Jun 84 15:33:38-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@SRI-AI.ARPA, shoham@YALE.ARPA,
kautz@SRI-AI.ARPA, hager@SRI-AI.ARPA, laws@SRI-AI.ARPA, hanson@SRI-AI.ARPA,
jmc@SU-AI.ARPA, dekleer@XEROX.ARPA, brown@XEROX.ARPA, pat@ROCHESTER.ARPA,
james@ROCHESTER.ARPA, mcdermott@YALE.ARPA, kim.hersk@UCB-VAX.ARPA,
levesque@SRI-KL.ARPA, witkin@SRI-KL.ARPA, pack@SRI-AI.ARPA,
grosof@SU-AI.ARPA, johannes@SU-CSLI.ARPA, deanna@SU-CSLI.ARPA,
wilkins@SRI-AI.ARPA, pmartin@SRI-AI.ARPA
Another meeting of the commonsense summer people this Wednesday, June 13,
at 10 am, in EK242 at SRI.
-- Jerry
-------
∂11-Jun-84 2248 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa meeting
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 11 Jun 84 22:48:31 PDT
Received: From ibm-sj.csnet by csnet-relay; 12 Jun 84 1:19 EDT
Date: 11 Jun 1984 14:20:26-EDT (Monday)
From: mike blasgen <BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa>
To: jmc@su-ai.arpa
Subject: meeting
thank you for letting me know that a meeting i didn't
know about is not going to be held.
we were in florida last week and had a really good time.
hot here in new york today--actually hotter than florida.
see you soon.
mike
∂12-Jun-84 0359 @MIT-MC:rwg@SPA-NIMBUS [STAFF.HERSHMAN at NYU20: nyc macsyma]
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 12 Jun 84 03:59:46 PDT
Received: from SPA-RUSSIAN by MIT-OZ via Chaosnet; 12 Jun 84 06:59-EDT
Date: Tuesday, 12 June 1984, 03:59-PDT
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: [STAFF.HERSHMAN at NYU20: nyc macsyma]
To: jmc at MIT-OZ
Message-ID: <840612035959.7.RWG@RUSSIAN.SPA.Symbolics>
Date: 11 Jun 1984 19:26 EDT (Mon)
From: Ittai Hershman <STAFF.HERSHMAN@NYU20>
Date: Wednesday, 6 June 1984 05:56-EDT
From: Bill Gosper <RWG at MIT-MC>
Well, actually I don't have contacts at Courant. Could you suggest
some names?
Tnx, --Bill Gosper
I just asked someone familiar with the politics, and they suggested that
you contact Anna Moore at Courant (212-460-7394). Anna is in charge of
accounts on the Courant academic machines. If you want to send her
snail mail, the address is:
Anna Moore
Courant Institute of Mathematical Sciences
Academic Computing Center
Warren Weaver Hall; Rm. 305
New York, NY 10003
Hope she can help...
-Ittai
--------
Should the Chudnovskys approach her directly, or should you or I or what?
(I just now remembered the Knopp book. Would 2230 or 2300 be too late to
pick it up?)
∂12-Jun-84 0712 @MIT-MC:KEN@MIT-OZ Re: foolog
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 12 Jun 84 07:12:25 PDT
Date: Tue 12 Jun 84 09:53:40-EDT
From: KEN%MIT-OZ@MIT-MC.ARPA
Subject: Re: foolog
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 1 Jun 84 23:01:00-EDT
I'll ask Martin for a pointer to Foolog and send it over the net to you.
His directory is full of many different versions.
-------
∂12-Jun-84 0714 BUCHANAN@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Jun 84 07:14:18 PDT
Date: Tue 12 Jun 84 07:15:00-PDT
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
cc: faculty@SU-SCORE.ARPA, library@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 8 Jun 84 22:44:00-PDT
John,
I believe the library is doing a reasonable job providing service
under the financial constraints that they suffer. There are trade-offs
that affect large numbers of people in balancing their budget. For
example, library hours, book buying and serials subscriptions are all
things that we want more of, but can't have at the same time.
Your comment about "hopeless chicken shit mode" wasn't very
constructive in providing guidance.
bgb
-------
∂12-Jun-84 1756 YOM
What is your opinion regarding the following message I received today?
∂12-Jun-84 1448 TU@SU-SCORE.ARPA cs206 incomplete
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Jun 84 14:48:39 PDT
Date: Tue 12 Jun 84 14:46:19-PDT
From: Samson Tu <TU@SU-SCORE.ARPA>
Subject: cs206 incomplete
To: yoram@SU-SCORE.ARPA
Dear Yoram,
If I remember correctly, I still have an incomplete in cs206
which you TAed in the autumn quarter. By the time I got to trying to
do the EKL program, EKL was deleted from lotsa system. Would it be
possible for you to give me a grade on the basis of the work I have
done in this course? I would very much appreciate you doing so.
Thank you. Samson
-------
∂13-Jun-84 0049 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 13 Jun 84 00:49:33 PDT
Date: Wed 13 Jun 84 00:50:34-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: nilsson@SRI-AI.ARPA, stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
georgeff@SRI-AI.ARPA, stickel@SRI-AI.ARPA, appelt@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, hobbs@SRI-AI.ARPA, rperrault@SRI-AI.ARPA,
barnard@SRI-AI.ARPA, pentland@SRI-AI.ARPA, pereira@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, blenko@SRI-AI.ARPA, dymetman@SRI-AI.ARPA,
kells@SRI-AI.ARPA, croft@SRI-AI.ARPA, kube@SRI-AI.ARPA, shoham@SRI-AI.ARPA,
kautz@SRI-AI.ARPA, hager@SRI-AI.ARPA, laws@SRI-AI.ARPA, hanson@SRI-AI.ARPA,
jmc@SU-AI.ARPA, dekleer@XEROX.ARPA, brown@XEROX.ARPA, pat@ROCHESTER.ARPA,
james@ROCHESTER.ARPA, mcdermott@YALE.ARPA, kim.hersk@UCB-VAX.ARPA,
levesque@SRI-KL.ARPA, witkin@SRI-KL.ARPA, pack@SRI-AI.ARPA,
grosof@SU-AI.ARPA, johan@SU-CSLI.ARPA, deanna@SU-CSLI.ARPA,
wilkins@SRI-AI.ARPA, pmartin@SRI-AI.ARPA
There will be a meeting of the Commonsense Summer people at 10 today in EK242
at SRI. I thought it would be a good idea if everyone would say a few words
about their research interests, to give everybody else an idea of who it would
be fruitful to talk to. Then I'll talk about an outline of a theory of
granularity.
-- Jerry
-------
∂13-Jun-84 0227 @MIT-MC:KEN@MIT-OZ foolog
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 13 Jun 84 02:27:18 PDT
Date: Wed 13 Jun 84 05:27:37-EDT
From: KEN%MIT-OZ@MIT-MC.ARPA
Subject: foolog
To: jmc@SU-AI.ARPA
Martin sent me the following message:
13-Jun-84 01:09:31,00000279;000000000001
Date: 13 Jun 1984 0109
From: Martin
To: Ken
Subject: Re: arpanet mail
In-Reply-To: Your message of 12-Jun-84 1638
Sure! But could you ask John McCarthy if he would like a fast and unreadable
version, or a slow but very readable version, or some compromise?
========
-------
∂13-Jun-84 0858 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -- June 15, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Jun 84 08:58:05 PDT
Date: Wed 13 Jun 84 08:57:34-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -- June 15, 1984
To: siglunch@SUMEX-AIM.ARPA
Professor Ted Crovello, Chairman of the Department of Biology, Notre Dame
University will give the Siglunch this coming Friday. A title and abstract
will follow.
-------
∂13-Jun-84 0953 DLW@SCRC-STONY-BROOK.ARPA Review
Received: from SCRC-STONY-BROOK.ARPA by SU-AI.ARPA with TCP; 13 Jun 84 09:53:38 PDT
Received: from SCRC-CHICOPEE by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 46332; Sun 10-Jun-84 17:51:25-EDT
Date: Sun, 10 Jun 84 17:49 EDT
From: "Daniel L. Weinreb" <DLW@SCRC-RIVERSIDE.ARPA>
Subject: Review
To: jmc@SU-AI.ARPA
In-reply-to: <840530110553.3.DLW@CHICOPEE.SCRC.Symbolics>
Message-ID: <840610174951.2.DLW@CHICOPEE.SCRC.Symbolics>
I received the book review; thank you!
∂13-Jun-84 1133 DFH
To: JMC, DFH
Jack Schwartz asks that you call him. 212 460 7209
∂13-Jun-84 1633 BSCOTT@SU-SCORE.ARPA Secretarial Applicants
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 84 16:33:45 PDT
Date: Wed 13 Jun 84 16:32:47-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Secretarial Applicants
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I hope very much to have a few applicants for you to interview next week.
Can you please let me know times when you will be available.
Thank you,
Betty
-------
∂14-Jun-84 1036 DFH
To: JMC, DFH
Call asking you to a meeting regarding the purchase of a Foonly computer.
Monday, 11:15-noon, Bldg. 1, Room 2E. Will call again Monday to see if
you are able to come.
∂14-Jun-84 1135 DFH
To: JMC, DFH
George Johnson called to check in with you, as you had directed him.
He said you had an appointment with him on Monday, 11 a.m. His
phone except for Sat. and Sun evenings is 857-0333.
∂14-Jun-84 1503 FY Thought you might be interested.
n058 1417 14 Jun 84
BC-BOOK-REVIEW-II
By WALTER GOODMAN
c. 1984 N.Y. Times News Service
The Rise of the Right. By William A. Rusher. 336 pages. William
Morrow & Co. $15.95.
''The Rise of the Right'' comes at us with endorsements from William
F. Buckley Jr., Sens. Jesse Helms, Orrin G. Hatch and Paul Laxalt and
Rep. Philip M. Crane. It's a model of truth in packaging.
William A. Rusher, who is publisher of The National Review, starts
with the story of how he came to be a conservative in the early
1950s. Given his prior path, from a comfortably situated Republican
family to Princeton University to Harvard Law School to a Wall Street
law firm, his conversion was less like being struck blind on the road
to Damascus than deciding to summer in Newport instead of Saratoga.
Rusher credits three books especially with his enlightenment:
Frederich von Hayek's famous attack on economic planning, ''The Road
to Serfdom''; Whittaker Chambers's ''Witness,'' with its vision of a
transcendental shoot-out between freedom and communism, and Russell
Kirk's ''Conservative Mind,'' an effort to apply the principles of
Edmund Burke to 20th-century America. The Divine Will played a part
in the works of both Chambers and Kirk, and Rusher, too, seems
confident that God is a conservative.
But he does not pause over such matters. He drops the names and
passes on to what really interests him - the ideological battle
within the Republican Party, going back to the nasty fight in the
1940s between the MKIDDLE Western conservative Sen. Robert A. Taft of
Ohio and that relatively liberal Easterner, Gov. Thomas E. Dewey of
New York.
This is Rusher's account of the eff6orts of conservatives like
himself to sustain the Taft heritage through many lean years. He felt
that President Dwight D. Eisenhower was too hard on Sen. Joseph R.
McCarthy. He characterizes Richard M. Nixon as ''devious'' and was
especially offended at President Nixon's deference to the Chinese on
the issue of Taiwan. Andhe didn't
at all like Gov. Nelson A. Rockefeller of New York, who seemed to him
to represent the same unorthodox interests and tendencies as Dewey
did.
Although Rusher offers some insights into such groups as the John
Birch Society, which he opposed, the battles for ascendancy within
the Republican Party over the last three or four decades have been
told before, and much of the material here was marginal to begin
with. Rusher is like a member of a marching band who returns from a
parade with news of seeing a brave show on his right, hearing a sour
note on his left, but without either the distance to give a sense of
what was going on all around or enough intimacy with the parade's
leaders to provide the real lowdown.
Although he attributes the current rise of the right to the strength
of its philosophy - anti-Communist, pro-family, free-market - Rusher
tends to take ideas and issues for granted, and to ignore momentous
events of the period he is covering. He has nothing to say, for
example, about the civil-rights movement of the 1960s, but he grows
excited about the direct-mail campaigns developed by conservative
fund raisers in the 70s.
Rusher's prose is not typically vibrant, but his boss, Buckley,
stirs his hyperbolic juices. The founding of The National Review in
1955 is treated like a second coming: ''But who, or what, could bring
the prickly components of the conservative movement together and
induce it to speak with a single journalistic voice? Who could
proclaim and refine conservatism's fundamental principles, resolve or
compromise disputes on internal issues, promote intellectual and
political spokesmen and lead the philosophical battle against both
communism and modern liberalism? Who (we now know history's a.swer)
but William F. Buckley Rr.?'' No wonder Buckley finds the book
''vivid and engrossing.''
Rusher, a veteran of intramural squabbles, gives a grudging welcome
to the neoconservatives who gained attention in the 1970s. He is put
off by the idea that conservative ranks were short of heavyweight
intellectuals before Irving Kristol showed up. ''The conservative
movement, by the 1970s,'' he asserts, ''was fully capable of holding
its own in the intellectual arena.'' But his judgment of what
constitutes a conservative intellectual tends toward the parochial.
He questions the credentials of George Will, possessor of probably
the best-stocked mind and most stylish pen among conservative
columnists, whose failing seems to be that he is not a National
Review regular.
Rusher pays tribute to Ronald Reagan for bringing together in a
winning alliance the economic conseratives and the social
conservatives. After praising the president's efforts ''to cut the
domestic budget or at least to reduce the rate of its expansion, to
prune the junglelike regulatory undergrowth, and to rebuild the
nation's defense,'' Rusher concludes with a prediction that should
comfort liberals: ''Conservatism, it seemed to me, not only had a
finer champion in the White House but, in the light of the odds in
politics, could rarely if ever expect to be quite so lucky again.''
nyt-06-14-84 1711edt
**********
∂15-Jun-84 0940 HOBBS@SRI-AI.ARPA General Meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 15 Jun 84 09:40:35 PDT
Date: Fri 15 Jun 84 09:42:48-PDT
From: HOBBS@SRI-AI.ARPA
Subject: General Meeting
To: commonsense.people: ;
The next general meeting of commonsense summer will be Monday, June 18, at
10 am in EK242 at SRI. Leslie Pack will talk a bit about circumscription --
how to take account of exceptions unobtrusively.
There is now a <COMMONSENSE> directory. So far it only has a list of the
people and the provisional outline of the summer on it.
-- Jerry
-------
∂15-Jun-84 1359 LEP Blocks Axioms
I revised my planning axioms using ab for the blocks world. After mentioning
it to Jerry Hobbs, he said he'd like me to talk about it at Monday's
common sense meeting. I'd like to have some friendly criticism before I
get attacked by the mob -- I wondered if you could read and comment on them?
It is currently in the file blocks.txt[1,lep]. Since this has to be readable
to people at SRI, it doesn't use the sail character set. If you think it
would be easier to read, I could change it all to prefix predicate calculus.
Thanks,
Leslie
∂17-Jun-84 1543 CLT kreisel
would like to say good-bye - if he hasn't already
called you, please call him between 4-6 at 325-9664
∂18-Jun-84 0842 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Jun 84 08:42:01 PDT
Date: Mon 18 Jun 84 08:41:15-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 16 Jun 84 17:40:00-PDT
Thanks, John. I have one person coming in today at 1:00. If she proves to
be a likely candidate, I hope you can talk with her.
Betty
-------
∂18-Jun-84 0846 BUCHANAN@SUMEX-AIM.ARPA LIBRARY KEYS (response to my inquiry)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Jun 84 08:46:02 PDT
Date: Mon 18 Jun 84 08:45:06-PDT
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: LIBRARY KEYS (response to my inquiry)
To: jmc@SU-AI.ARPA, golub@SU-SCORE.ARPA
Return-Path: <LIBRARY@SU-SCORE.ARPA>
Received: from SU-SCORE.ARPA by SUMEX-AIM.ARPA with TCP; Mon 18 Jun 84 08:41:23-PDT
Date: Mon 18 Jun 84 08:41:20-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Keys to the Library
To: buchanan@SUMEX-AIM.ARPA
Bruce,
The University (not the library) will not allow a restricted policy determined
by deparments. This is the ruling that I was told when the library
presented the issue. It is also one of the reasons why once keys are given
out there can be no control of the numbers that would be given out.
At this point, the library committee has reaffirmed the new policy and the
installation of the security system should be completed by fall. How many
faculty are we talking about and what hours do they think they would be using
the library?
Harry
-------
-------
∂18-Jun-84 0900 JMC*
Reidel
∂18-Jun-84 0920 HOBBS@SRI-AI.ARPA Meeting reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 18 Jun 84 09:19:52 PDT
Date: Mon 18 Jun 84 09:22:12-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting reminder
To: commonsense.people: ;
There is a general meeting for Commonsense Summer this morning at 10 am,
in EK242 at SRI. Leslie Pack will talk about circumscription.
-- Jerry
-------
∂18-Jun-84 1019 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT -
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Jun 84 10:19:28 PDT
Date: Mon 18 Jun 84 10:16:16-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT -
To: siglunch@SUMEX-AIM.ARPA
There will be NO Siglunch this Friday, June 22, l984. The next Siglunch
will be held on June 29, l984. Steve Rosenberg, Hewlett-Packard, will
be the speaker. A title and abstract will follow at a later date.
-------
∂18-Jun-84 1033 DFH
To: JMC, DFH
I do not know Susan's married name so I cannot look up her address in PHON.
∂18-Jun-84 1102 DFH
To: JMC, DFH
Paul Johnson with whom you had a tentative appointment at 11 a.m. will
be back at 1 p.m., hoping to see you than.
∂18-Jun-84 1122 DFH
To: JMC, DFH
Charles Pelton, TIME magazine, called. Would like to talk with you about
your reaction to MCC in Austin. 982-5000 (415)
∂18-Jun-84 1613 DFH
To: JMC, DFH
Jack Schwartz returned your call. Please call him at his home this
evening. 212 673 3242
∂18-Jun-84 2233 YOM Samson Tu
I don't have the results of the CS206 final, or the final draft of homework
grades (You finished grading after I had already left for a conferrence).
From the partial information I do have, his initial work was on an A- level.
Yoram.
∂19-Jun-84 0344 pratt@Navajo
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 03:44:31 PDT
Date: Tue, 19 Jun 84 03:43:35 pdt
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: buchanan@SUMEX-AIM.ARPA, golub@SU-SCORE.ARPA
In-Reply-To: Your message of 16 Jun 84 1749 PDT.
From: Vaughan Pratt <pratt@Navajo>
My understanding was that the library-key issue was the subject of much
discussion by library users as well as library staff, and that the final
decision was arrived at by consensus. I certainly didn't get the impression
that Llull simply inflicted this on the community on his own.
Yorktown has a big advantage over Stanford: next to no randoms roaming the
corridors. (I have occasionally roamed Watson unescorted myself, but I doubt
that their library is at any significant risk from such randoms.)
Incidentally I would prefer to have a key myself. Maybe the trick is to have
the community trust the faculty not to let in randoms and allow us to have
keys.
-v
∂19-Jun-84 0646 rose@rochester.arpa Very High Performance Computing
Received: from ROCHESTER.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 06:35:49 PDT
Received: from ur-seneca.rochester.arpa (ur-seneca) by ur-cayuga.rochester.arpa id AA01729 (4.12f); Tue, 19 Jun 84 09:28:09 edt
Received: by ur-seneca.rochester.arpa id AA15364 (3.327.5f); 19 Jun 84 09:35:43 EDT (Tue)
Message-Id: <8406191335.15364@ur-seneca.rochester.arpa>
Date: 19 Jun 84 09:35:43 EDT (Tue)
From: Rose Peet <rose@rochester.arpa>
Subject: Very High Performance Computing
To: jmc@SU-AI.arpa
Dear Colleague,
As you may know, George Keyworth is appointing a panel to advise
on very high performance computing. Unaccustomed as I am to being considered
a leader of AI, that appears to be the situation here.
---------------------
--------------------
From: ICS.BROWNE@UTEXAS-20.ARPA
Subject: A Committee for a National Policy on Research and Development on Very High Performance Computing
To: feldman@SUMEX-AIM.ARPA
I have been asked by the Office of Science and Technology Policy to form a
committee to come up with a national requirements statement for research
and development in very high performance computing. The charge for this
committee is: 1) to develop a requirements statement for a nationwide
policy and requirements statement on research and development in very high
performance computing, 2) to assess existing programs of the agencies
concerned with very high performance computing, 3) to map the requirements
statement against existing programs to determine gaps which may exist and
to recommend allocation of responsibilities for uncovered research and
development, and 4) to support OSTP in implementation of these requirements
in terms of policy and funding.
One of the viewpoints I bring into such a committee is the really important
need for having representation by application areas as well as architects,
software, and technology people. Clearly, you would be a marvelous repre-
sentative for the artificial intelligence community on such a committee.
I realize that you have served your turn on national committees. On the
other hand, your degree of success in service on national committees also
argues for continuing this service. Your name has been suggested by a
number of distinguished people in the areas as the ideal representative
for AI. Please give me a call or send me an Arpanet message if you want
further information or you want to discuss this before volunteering.
-------
-------
There is no way to predict how seriously the committee will be taken,
but it could be important. It would be very helpful if you could send me
your ideas on the amount and nature of very high performance computing
needed for AI; text suitable for inclusion in a report would be especially
welcome. This could also be viewed as an opportunity for the AI community
to demonstrate the technical leadership we have often claimed.
Jerry Feldman
∂19-Jun-84 0730 @SU-SCORE.ARPA:SJ@MIT-XX.ARPA Prolog Reference
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 07:30:36 PDT
Received: from MIT-XX.ARPA by SU-SCORE.ARPA with TCP; Tue 19 Jun 84 07:29:36-PDT
Date: Tue 19 Jun 84 10:30:22-EDT
From: Suresh Jagannathan <SJ@MIT-XX.ARPA>
Subject: Prolog Reference
To: jmc@SU-SCORE.ARPA
cc: sj@MIT-XX.ARPA
Prof. McCarthy,
I had spoken to you briefly during the IFIP WG 2.2 meeting regarding some
references which you may have concerning your work on incorporting control
into Prolog. I would like to know if it would be possible for you to
send me these references or, if not, to direct me to the appropriate sources.
As I had mentioned to you last week, I have been examining the implementation
of CONNIVER (and Prolog) and think that your work may have some bearing
on mine.
Thanks for your help,
--Suresh Jagannathan
545 Technology Square
Cambridge, MA 02139
-------
∂19-Jun-84 0906 DFH
To: JMC, DFH
Panofsky called from SLAC. Has Danish visitor from U. of Copenhagen. Could
an evening meeting be arranged? 28-2601.
∂19-Jun-84 0925 AAAI-OFFICE@SUMEX-AIM.ARPA On-line abstract/library report
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 09:25:06 PDT
Date: Tue 19 Jun 84 09:24:06-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: On-line abstract/library report
To: JMC@SU-AI.ARPA, Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Walker@SRI-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, Mannuck@SU-SCORE.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Well, we finally finished the report about our findings and
recommendations about the on-line abstract/library service.
We look forward to hearing your comments about the report.
Richard Mannuck
Claudia Mazzetti
FINDINGS AND RECOMMENDATIONS FOR AN ON-LINE BIBLIOGRAPHIC ABSTRACT/
LIBRARY SERVICE
Richard Mannuck, Stanford University Claudia Mazzetti, AAAI
After the proposal for an on-line bibliographic abstract service was
introduced at the 1983 Executive Council meeting in Washington, D.C.,
a series of meetings were held in the Palo Alto area to further
examine this proposal. Attendees at these meetings were John
McCarthy and Mike Genesereth, Stanford University; Don Walker, Robert
Amsler, Elizabeth Feinler, SRI International; and Claudia Mazzetti,
AAAI.
The initial meetings discussed the feasibility of such a service versus
a full text service. The issues noted in our discussions follow:
* Should the AAAI act as an operator of such a service or
just fund the building of the database (db)?
* Should the AAAI buy time at a local SU computer if it
does decide to operate this service?
* Should the AAAI prepare a proposal for DARPA support?
* What are the copyright issues as it relates to full text
and abstracts? Does the AAAI possess
the copyright to its own publications?
* What anticipated problems should we expect from the publishers
when trying to license the use of copyrighted works on-line?
* What are the start-up costs for a full text or abstract service
operated or supported by the AAAI?
* How do you handle keywords and mathematical notations?
After these meetings, efforts were made to gather more information
about these issues regarding full text and bibliographic abstract
services. The following section describes our findings on these
different issues.
BIBLIOGRAPHIC ABSTRACT SERVICE
Organizations interested in bibliographic abstract services can be
grouped into two categories -- brokers and builders of databases.
As brokers, BRS, DIALOG and SDC are considered the "Big 3" with
DIALOG having the lion's share of the business. SRI and IAS are
just two groups out of a countless number of db developers.
Copyrights
The typical abstract in db are no more than brief identifying
statements of the subjects covered in the document, making such
abstracts of copyrighted works are not an infringement of the
copyright. However, the so-called "abstract" which is a digest of the
substance of a copyright work could be interpreted as a substitute of
the work itself and therefore would constitute a derivative work.
Anyone writing such abstract would infringe the copyright.!
It has been determined from conversations with William Kaufmann and
Don Walker the AAAI does not possess the copyright of its own
publications -- the proceedings and the AI Magazine. It is strongly
advised to obtain the consent of the authors to use their abstract and
full text before anyone begins to compile the references or full text
for this database
Scope of an On-line Abstract Database Service
For the purposes of this report, it is assumed that the scope of
the number of AI articles is essentially described by
"Computing Reviews" Classification I.2:
"I.2 Artificial Intelligence
I.2.0 General
I.2.1 Applications and Expert Systems
I.2.2 Automatic Programming
I.2.3 Deduction and theorem Proving
I.2.4 Knowledge Representation: Formalisms and Methods
I.2.5 Programming Languages and Software
I.2.6 Learning
I.2.7 Natural Language Processing
I.2.8 Problem Solving, Control Methods and Search
I.2.9 Robotics
I.2.10 Vision and Scene Understanding
I.2.m. Miscellaneous"
However, "Robotics" is limited to "intelligent" robots (planning,
vision, programming) - in line with the practice of the core AI
journals and conferences. Treating the whole field of robotics
(including all of its mechanical engineering aspects and commercial
applications) would approximately double the size of the database, and
there is already a journal, "Robotics Technology Abstracts" (published
monthly by Cranfield Press), which serves this purpose fairly well.
"Computing Reviews-Classification I.2" leaves out image processing and
pattern recognition which were once considered part of AI. Including
these areas would triple or quadruple the size of the database.
Size of the On-line Abstract Database
It is difficult to determine the exact number of publications in AI every
year - much less the total number of publications in the field - without
actually building a bibliography.[Bruce Buchanan is developing such
a bibliography that the AAAI is partially supporting.]
It is possible to count the number of articles in the core AI
journals, collections, and proceedings and to count the number of
reports produced by the major 20 or so AI centers. Those numbers are
currently 1,100 and 400 respectively. Judging from current AI
bibliographies, for every three articles in core AI publications,
there are two in non-specialist publications. Further, judging from
the affiliations of authors in AI (and assuming that the number of
-2-!
reports people produce is proportional to the number of papers they
publish), for every two reports produced at major AI centers, there
should be roughly three articles produced elsewhere. If one applies
these ratios to the figures above, one gets 1,832 published papers and
1,000 reports and 20 or so monographs per year or a total of 2,850
citations per year.
Judging from the distribution of publications by year in AI
bibliographies, the total number of AI publications is approximately
ten times the current yearly output or roughly 29,000 citations. A
large proportion of technical reports are subsequently published in
journals, collections, or proceedings, so the overall number of unique
publications in AI is probably around 30,000.
Depending on the amount of overlap that is desired in the areas of
linguistics, robotics, pattern recognition, and image processing, both the
yearly and the total figures could be higher.
Building and Maintenance of an On-line Abstract Database Service
The following tasks are associated with the building and operation
of an on-line abstract service. Definition of these tasks is
based on conversations with managerial staff of "Computing Reviews",
"Math Reviews", and NTIS.
Acquisition and Selection of Abstract: Someone will have to be in
charge of obtaining publications or abstracts of publications. They
will have to decide what is to be included from the overlapping areas
of robotics, linguistics, and image processing. They will also have
to locate papers which are not in the core AI journals and conference
proceedings and technical reports which are not from the major AI
centers. Since they will be familiar with the sources, they might
also establish the bibliographical entry for the person inputting the
data.
With 2850 publications per year, this would probably take 3 months of
someone's time.
Classification: Classifying publications by subject would require
someone with subject expertise, but it would not take much time.
Judging from the experience of "Mathematical Reviews" and "Computing
Reviews" and assuming a classification scheme of roughly the same
depth as theirs, a classifier could probably handle twelve documents
per hour or one every five minutes. At this rate, 2850 publications
would take 31 days or one-and-a-half months to classify.
-3-!
Indexing: NTIS indexes their reports using a controlled vocabulary of
subject terms. On the average, their subject specialists index five
reports an hour or one very twelve minutes. If anything, an AI
indexer would go faster than that since, covering a smaller area than
the subject specialists at NTIS do, he would know it more thoroughly.
At a rate of one document every twelve minutes, 2850 publications
would take 76 days or three-and-a-half months to index.
As for 'free' vocabulary terms, most of these would be found in the
abstract, and, provided that the abstract is on-line and searchable,
they wouldn't be needed.
Abstracting: To keep costs down, it would make sense to use author's abstracts
rather than write our own. Then it would only be necessary to compose
abstracts in cases in which the author fails to supply one or in cases
in which the abstract is written in a foreign language.
Abstracts - if extensive enough - are covered by copyright However, it
would probably be easier to obtain permission to use the authors'
abstracts than to write our own, since (1) writing original abstracts
isn't without legal problems either (see discussion under "Copyright"
above) and (2) for 2850 pub- lications, this would require one or two
full-time employees with expertise in the subject.
Data Entry: Records should be about 250 words on the average (160 words for the
abstract, 40 words for the bibliographical description, and another 50 words
for classification codes, indexing terms, etc.). At an average typing speed
of 60 words per minutes, 2850 records would take 16 days or not quite half a
month to input.
Economics
If the AAAI operated an on-line abstract service, a preliminary budget
follows:
Task Labor
Initial $ Maintenance $
------------------------------------------------------------------------------
Acquisition of abstracts
or full text .75/man year $ 14,700 .25/man year $ 4,900
Scan non-core journals
and magazines
Classification of
references (1 article/
5 minutes) 3.0/man years $117,600 .25/man year $ 9,800
-4-!
TASK LABOR
Initial $ Maintenance $
------------------------------------------------------------------------
Indexing the References
(5 documents/hour or .33/man year $13,066
1 minutes/document)
for back-up(25 yrs
of articles) 3.3/man years $129,360
Data Entry 2.5/man years $ 31,850 .25/man year $ 4,900
--------------------------------------------------
Labor Subtotal 9.55 man years $293,510 5.75 man years $32,666
Materials & Supplies
Computer Usage $50-100K/yr
Lease of DB software ?
Overhead Rate ?
-------------------------------------------------
Total $298,510-393,510 $87,566 -137,566
Financial resources for such an operation are probably out of
reach for the AAAI at this time. DARPA support should be pursued for
such a venture.
The other approach is to have AAAI fund an outside group (e.g. SRI,
IAS) to develop the database and then sell it to a vendor (e.g.
DIALOG, BRS). The AAAI would initially be responsible to
collect the documents and prepare an indexing schema for
the builder of the database. In the future, the AAAI would be
responsible in maintaining the AI database with the vendor.
The initial budget would include the following tasks:
* Funding the building of the database ($50-100K);
* Use of an existing AI taxonomy (e.g. D. Waltz's
for Comtex) or develop our own (that means, hiring
a consultant - $25K);
* Cost of a 1/2 person to collect and prepare the
monthly maintenance reports to the vendor ($12-15k).
The initial costs would approximately be $87,000 to $140,000
(without any application of an overhead rate).
-5-!
ON-LINE FULL TEXT SERVICE
A review of published articles and interviews with full text services
indicate those services are in the experimental or developmental
stages in most fields. Only in the medical/legal fields do large full
text services offer access to large comprehensive bodies of data. BRS
also provides full text access to ACS's 18 journals. BRS, DIALOG and
SDC/Orbit offer full text access to limited number of reference books
such as "Books in Print" and "Everyman's Encyclopedia." In addition
to the above mentioned services, the following organizations do or
might offer such services:
*Elsevier-North Holland now offers a full text service
of its own publications.
*American Chemical Society, although it offers a full text
service through BRS, may spin off a separate subsidiary
to build full text or bibliographic databases for other
organizations.2
*Quotron Systems provides corporate data to its users.
* Dow Jones & Co. provides general news, corp data, and
quotes on 6,000 stocks.
* AAAI might operate such a service.
In a recent Library of Congress report (December, 1983) on the status
of full text services, the following limitations were noted:
"... * Little or no illustrative material available on-line;
* Poor end product to work with:
a. CRT screen images.
b. printouts.
c. limited use of color.
* No standards for inputting, formats, retrieval or displays.
* No guarantee that services will stay in business."
Copyrights
Questions as to the input and output of copyrighted documents are
substantially the same as pertaining to the input and output of
copyrighted databases. Despite the considerable discussion as
whether the input of copyrighted documents should be free ("fair use"),
with a license and payment to the copyright owner being required for output,
or whether a license should be required before input, it is recommended
that first, the AAAI gain access to its own documents and second, establish
a series of contracts with publishers before the AAAI begins to assemble
or process any materials.
Our findings further indicate that the use of copyright materials,
other than the AAAI's, are obtainable at extremely high cost to the
AAAI. Based on conversations with the staff at the Library of
Congress; NEXUS, an on-line full text service of medical documents;
-6-!
and the American Association of Publishers, several reasons exist for
the high cost of leasing full text rights. Publishers are apprehensive
about browsing on-line. In fact, in order to compensate for the
perceived loss of revenues, NEXUS charges for browsing on-line.
Furthermore, the American Association for Publishers said there are
yet no established standards for the compensation of on-line browsing,
and it was not likely to occur in the near future. Probably the
publishers' most serious anxieties about on-line full text are the
potential huge loss of paper subscriptions to journals and magazines
and, most importantly, the loss of entire databases from piracy.
Economics
If the AAAI operated its own full text service, the initial costs
would be extremely close to the start-up costs for the abstract
service except for the data entry.
If the AAAI did not operate a full text service but rather sponsored the
building of one, a breakdown of costs might include:
* AAAI negotiates with the publishers, initially and on a continuing
basis; legal assistance to prepare all contractual arrangements with
publishers (costs are difficult to determine-don't know
how much time our lawyer would spend on these negotiations);
* 3/4 or full time person to collect and maintain the updates
to the db ($25K);
* Building of the full text database ($100-200k); and
* Overhead (equipment, space, support - $10,000).
A preliminary budget for an AAAI supported full text service could
range from $135-235k+ or even higher. Other considerations are
location of such a service and proper managerial supervision of the
service.
STRATAGEMS
Based on our findings and financial considerations, below is a
possible plan that initially emphasizes a straightforward, simple
approach for the establishment of an abstract database and finally
develops into a more complex, operational full text service.
Prior to any decision to proceed, these preliminary
activities should be completed:
* Gain the consent of each author from each
proceeding and AI Magazine issue, since the AAAI apparently does
not own the copyright of such works; and
* assemble a preliminary bibliography (we can continue to support the
building of the Buchanan bibliography).
After these tasks have been completed, we can then consider the following
options:
-7-!
Option No. 1
* Sponsor the development of an abstract database by
an outside group (e.g. SRI). AAAI's responsibilities would
then include the negotiations with the publishers and to
assist in the collection of the citations.
* AAAI sells its database to a vendor. This will allow the AAAI to
recover some of its development costs and help support the continuing
maintainance of the database. The AAAI should stipulate in its
agreement with the vendor a 30 day termination notice by the
AAAI to the vendor. This will allow us to terminate service when
it becomes inefficient or costly or when we decide to move the
database to our own computer.
* Concurrently, the AAAI can begin to develop its
own service - locate computing and staffing resources, etc.
When the service is in place, we can then move the database
from the vendor to our own service.
* By that time (3-5 years), we can begin to negotiate for
the use of full text rights (maybe the publishers won't be so
apprehensive by that time) and finally develop the full text
database.(The full text database could be developed by the
AAAI or by an outside group, e.g. ACS.)
Option No. 2
Another plan is to establish another publication (quarterly) for
abstracts and critical reviews. Many persons with an interest
in artificial intelligence may not have access to the ARPANET or the
CS-NET, so it might be desirable to have a printed as well as an on-line
version of reviews and abstracts.
If the AAAI were to establish another publication, it has been assumed
- based on the size of the AI literature - that about one
hundred publications would be reviewed a year. This would be an
operation on a much smaller scale than that of "Computing Reviews"
(1000 reviews per year) or "Mathematical Reviews" (30,000+ reviews per
year). The closest parallel would be the "SIAM Review" which
published 68 book reviews last year. According to Arthur Wouk, a
recent review editor for "SIAM Reviews," the operation required only a
small portion of his time and some part-time secretarial help.
Assuming that the editorship is an honorary position, the only
staffing needed for AI reviews would be a 1/2 secretary and a 1/2 TEX
specialist.
-8-!
Both Prof. Wouk and Bernie Rous, the Executive Editor of "Computing Re-
views," stressed the importance of computerizing the selection of reviewers
and felt that the major cost would be the initial one of setting up such a
system.
Assuming that you packed the abstracts as densely as NTIS does
in its "Government Reports Announcements" (they get 10 or 12 abstracts
per page in three columns with a very small font for the abstract and
a larger font for the bibliographical description of the report), 2850
abstracts a year would require something less than 285 pages.
Including the author indexes for each issue and 100 or so pages for
reviews in a normal size font, and the magazine would run to about 400
pages per year. If published quarterly, each issue would then be
approximately 100 pages or roughly the current length of the "AI
Magazine."
Although arranged by classification, the printed abstracts would be
meant for browsing, not for searching by subject - since the on-line ver-
sion would be available for that and would serve the purpose much better.
For this reason and because there would not be a great number of issues
per year, you could probably do without the type of cumulative annual
index to citations (by author, subject, classification code, etc.) which
abstracting journals often provide.
The printed abstracts could be produced directly from the database,
presumably with a TEX macro to assign each bibliographical element a par-
ticular font and position in the printed record and some means of trans-
lating the on-line encodings of mathematical notation and special charac-
ters into their TEX equivalents. Assuming that the reviews were also input
into some sort of structured database, they could be typeset the same way.
----------------------------------------
Footnotes
1 During one meeting, Elizabeth Feinler, representing
the ARPANET's Network Information Center (NIC), informed us that
the NIC was working with DIALOG, a database vendor, to distribute
bibliographic references across the ARPANET. The group then
met with DIALOG's Barbara Cerny to ask about the developing
relationship between DIALOG and the ARPANET and to inquire about
the DIALOG's full text capabilities. Cerny explained that the
full text capabilities of some databases (e.g. HBR) was limited
to 32k characters/record; however, with the anticipated rewriting of
the software, this limitation would change.
-9-!
She also explained the typical arrangements between DIALOG and
sponsoring organizations (that is, organizations that prepare the
databases). Before any agreement is signed by both parties, the level
of profitability (i.e. level of usage, market demand) must be
determined first by DIALOG and sponsor. After it is decided to
proceed, sponsor would build the building of the database, and then
would license it to DIALOG. The agreement would specify the royalty
amount for the sponsor and would note the detailed arrangements for
partial updates of the db.
She also informed us the cost to the user of an hour of a typical
DIALOG db was approximately $50-60/hour (connect time was about
$8/hour). The cost to the user was dependent on the amount of the
royalty paid to the sponsor, number of updates, and any reloading of
the db. She did mention that off-hour use cost about $25/hour. In
addition, in order to learn to use the searching capabilities of
DIALOG, it took about 1 day of training.
2 ACS's full text charges are approx $66-80/hour to the user.
$16-30/hour is the hook-up charge from BRS and the remainder
($50) is ACS's royalty fee. ACS's royalty rate is high so
to reimburse ACS's outlay for research & development of the
full text service.
ACS took 10 years to develop the service (6 years of research,
the remainder for development). Remember, ACS's full text service is
a compilation of ACS's 18 journals; they did not have to
negotiate with other publishers for full text rights of their
documents.
ACS has a non-exclusive agreement with BRS and can terminate
this agreement by giving a 30 day notice to BRS.
ACS decided to perform data entry by hand rather than using
an optical character readers. They found it to be better
and cheaper than OCRs.
-10-!
-------
∂19-Jun-84 1002 AAAI-OFFICE@SUMEX-AIM.ARPA Execcom meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 10:02:07 PDT
Date: Tue 19 Jun 84 10:00:53-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Execcom meeting
To: bledsoe@UTEXAS-20.ARPA, JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I'd like to send out a message to the members of the Executive Council
regarding the time and place of the meeting with an accompanying
agenda soon. Can you provide me with an agenda in the near future?
Thanks,
Claudia
-------
∂19-Jun-84 1010 DFH
To: JMC, DFH
I talked with Panofsky's secretary. Told her you could see him between 1-1:30
or 5-5:30 (workshop is over at 5:30 according to Philosophy office). She
talked with the Danish gentleman who said he would forgo the meeting this
time as the time would be so short and the schedule difficult.
∂19-Jun-84 1027 GOLUB@SU-SCORE.ARPA keys
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 10:27:17 PDT
Date: Tue 19 Jun 84 10:23:53-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: keys
To: LIBRARY@SU-SCORE.ARPA
Dear Harry,
It is quite important that keys be issued to the faculty members. I don't
know what actions have to be done but unless keys are provided we will
need to take retalitory action which may have an adverse affect on your
operations.
GENE
-------
∂19-Jun-84 1317 DFH
To: JMC, DFH
David Chudnovsky asks that you call him.
∂19-Jun-84 1501 DFH
To: JMC, DFH
Prof. Zand called from Cal State Sacramento and wants to bring a class to
look at our facilities. Wishes to talk to you about this.
Secr. 916 454 6624 His office 916 454 7336
∂19-Jun-84 1634 @MIT-MC:rwg@SPA-NIMBUS knopp
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 16:34:39 PDT
Received: from SPA-RUSSIAN by MIT-OZ via Chaosnet; 19 Jun 84 17:55-EDT
Date: Tuesday, 19 June 1984, 04:51-PDT
From: Bill Gosper <rwg at SPA-NIMBUS>
Subject: knopp
To: jmc at MIT-OZ
Message-ID: <840619045118.5.RWG@RUSSIAN.SPA.Symbolics>
I don't know what's the matter with my jellyware, but i have been trying for
a solid week now to remember to acknowledge its appearance at weyhrauch's.
tnx much. i am reading myself to sleep with it. i'll return it when i reach
the end, or sooner if you give the word.
∂19-Jun-84 1755 BOSACK@SU-SCORE.ARPA DEC computer for the File Server
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 17:55:25 PDT
Date: Tue 19 Jun 84 17:54:35-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: DEC computer for the File Server
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA, Gotelli@SU-SCORE.ARPA
Dec is having a year-end sale. They originally offered us a Vax 750,
and a 6250 tape drive for 96K. If we are willing to buy some of their
disk (Which we could use on Navajo if we had no other pressing need), they
offer us a package of: The Vax, 2 tape drives, 6 474MB disks+controllers,
a high-speed console, Ethernet interface and 2MB additional memory for
about $130K. Should I take them up on the deal? Should DARPA pay for
the increased peripherals or should the department?
As the order must be in by the end of this week, we may have to pledge
CSD money until the DARPA approval is obtained.
Len
-------
∂19-Jun-84 1936 GOGUEN@SRI-AI.ARPA initiality book draft
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 19 Jun 84 19:36:09 PDT
Date: Tue 19 Jun 84 19:36:42-PDT
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: initiality book draft
To: jmc@SU-AI.ARPA
cc: goguen@SRI-AI.ARPA, meseguer@SRI-AI.ARPA
john,
Many thanks for your interest and patience! Today I put a draft into
the interdepartmental mail; it has some pimples and warts. But we would be
glad to answer any questions you might have. (But we will be gone for 2-3
weeks starting at the end of this week.)
Fond regards,
joseph
-------
∂20-Jun-84 0010 YOM Your grade
To: Tu@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA
Prof. McCarthy is taking care of giving you a final grade for the course.
He will probably notify you when he does. Otherwise, (if you don't hear from
him in a week), send him a message (to jmc@sail).
Yoram.
∂20-Jun-84 0021 @MIT-MC:MDC.WAYNE@MIT-OZ Artificial Intelligence Abstracts
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 20 Jun 84 00:20:57 PDT
Date: Wed 20 Jun 84 03:20:51-EDT
From: MDC.WAYNE%MIT-OZ@MIT-MC.ARPA
Subject: Artificial Intelligence Abstracts
To: JMC@SU-AI.ARPA, AAAI-OFFICE@SUMEX-AIM.ARPA
cc: MDC.WAYNE%MIT-OZ@MIT-MC.ARPA
In a recent AIList Digest I suggested that it would be useful to
initiate a publication which would gather together from many
disciplines and fields of inquiry all those abstracts which are
pertinent to AI research. Ron Brachman replied in a private message
to me that you might be pursuing a project of this nature.
Do you know if any progress is being made currently in getting
*Artificial Intelligence Abstracts* (or its equivalent) off the
ground?
Following is my original message on the subject in AIList Digest
and Ron Brachman's comment.
---------------------------------------
Message 5 (18528 characters):
Received: from MIT-MC by MIT-OZ via Chaosnet; 21 May 84 03:24-EDT
Date: Sun 20 May 1984 22:43-PDT
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>
Reply-to: AIList@SRI-AI
US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025
Phone: (415) 859-6467
Subject: AIList Digest V2 #60
To: AIList@SRI-AI
AIList Digest Monday, 21 May 1984 Volume 2 : Issue 60
Today's Topics:
AI Literature - Artificial Intelligence Abstracts,
Survey - Summary on AI for Business,
AI Tools - LISP on PCs & Boyer-Moore Prover on VAXen and SUNs,
Games - Core War Software,
AI Tools - Display-Oriented LISP Editors
----------------------------------------------------------------------
Date: Sun 20 May 84 14:10:16-EDT
From: MDC.WAYNE%MIT-OZ@MIT-MC.ARPA
Subject: Artificial Intelligence Abstracts
Does anyone else on this list wish, as I do, that there
existed a publication entitled ARTIFICIAL INTELLIGENCE
ABSTRACTS? The field of artificial intelligence is probably the
supreme interdisciplinary sphere of activity in the world, and
its vital concerns extend across the spectrum of computer
science, philosophy, psychology, biology, mathematics, literary
theory, linguistics, statistics, electrical engineering,
mechanical engineering, etc.
I wonder if one of the major member publishers of the NFAIS
(National Federation of Abstracting & Indexing Services) could
be convinced to undertake the publication of a monthly
reference serial which would reprint from the following
abstracting services those abstracts which bear most
pertinently on the concerns of AI research:
Biological Abstracts / Computer & Control Abstracts /
Computer & Information Systems Abstracts Journal / Current
Index to Journals in Education / Dissertation Abstracts
International / Electrical & Electronics Abstracts /
Electronics & Communications Abstracts Journal / Engineering
Index / Government Reports Announcements and Index /
Informatics Abstracts / Information Science Abstracts /
International Abstracts in Operations Research / Language and
Language Behavior Abstracts / Library & Information Science
Abstracts / Mathematical Reviews / Philosopher's Index / PROMT
/ Psychological Abstracts / Resources in Education / (This is
by no means a comprehensive list of relevant reference
publications.)
Would other people on the list find an abstracting service
dedicated to AI useful? Perhaps an initial step in developing
such a project would be to arrive at a consensus regarding what
structure of research fronts/subject headings appropriately
defines the field of AI.
--Wayne McGuire
---------------------------------------
Message 7 (437 characters):
Received: from MIT-MC by MIT-OZ via Chaosnet; 21 May 84 16:12-EDT
Date: Mon 21 May 84 09:45:00-PDT
From: Ron Brachman <Brachman at SRI-KL>
Subject: AI Abstracts
To: MDC.WAYNE%MIT-OZ at MIT-MC
You should contact John McCarthy. From what I have heard, he has
planned to do something like this for a while, and it may already be
underway. You could also check with the AAAI Office
(AAAI-OFFICE@SUMEX).
Ron Brachman
---------------------------------------
-------
∂20-Jun-84 0046 ME NYTimes going away soon
To: bosack@SU-SCORE.ARPA, JMC@SU-AI.ARPA
I got a call today from the AP (which handles the actual wire installations,
uh, and removals, for the NYT). They have orders to remove our NYT modem,
which they will do in a day or two. The news is still coming in over the
wire now, but this seems to be it for the NYT wire. Want to try to get
UPI or Reuters or some other?
∂20-Jun-84 0540 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Execcom meeting
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 20 Jun 84 05:33:37 PDT
Date: Wed 20 Jun 84 07:32:56-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Execcom meeting
To: AAAI-OFFICE@SUMEX-AIM.ARPA, bledsoe@UTEXAS-20.ARPA, JMC@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Tue 19 Jun 84 12:02:20-CDT
Claudia,
I will look at your proposed agenda and get back with you soon.
John, it would seem to me that you should take the first cut at
the contents of the agenda, and suggest at what point in the agenda
that I should take the chair. Woody
-------
∂20-Jun-84 1100 DFH
To: JMC, DFH
Floyd Kelly called from Guide, Int'l. Evidently you have talked with
him about participating in a meeting either Nov. 5 or 6, and he would
like some background info on your work in AI. To be sent to him
at E-Systems, PO Box 1056, Greenville, Tx 75401. Mailstop 127. Says
he needs it next week.
∂20-Jun-84 1128 DFH
To: JMC, DFH
Can you see another candidate for the secretarial position about
4:45 this afternoon?
∂20-Jun-84 1300 DFH
To: JMC, DFH
Please call David Chudnovsky.
∂20-Jun-84 1321 DFH
To: JMC, DFH
U..S. Air does not yet have a club lounge at Kennedy.
∂20-Jun-84 1327 BSCOTT@SU-SCORE.ARPA Len Bosack's message re equipment purchase
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jun 84 13:27:29 PDT
Date: Wed 20 Jun 84 13:26:41-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Len Bosack's message re equipment purchase
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, I have just learned that Len Bosack will not be here for the remainder
of the week, and so cannot receive your response to the question about the
equipment purchase in time to meet the deadline. Can you please respond to
me, so that we can prepare the paperwork, providing your response is "go ahead
and purchase." If you don't approve, please also let me know that.
Thanks,
Betty
-------
∂20-Jun-84 1354 DFH
To: JMC, DFH
Dan Slotnick (?) from U. of Illinois called. Asked me to take this
message:
Looking for a section head for the concurrent processing and AI section in
the center at Goddard, on whose advisory committee you agreed to serve.
Job is slated at GSl4-l5. Can go up to the mid 50's.
Looking for a PhD in AI-concurrent processing with some experience who can
direct a small good research group and be active himself.
If you could suggest to me with a phone number, give me a call.
301 338 7518 at J. Hopkins where he is for summer.
If you can solicit a resume, even better. Please send it.
∂20-Jun-84 1407 WALKER@SRI-AI.ARPA Re: On-line abstract/library report
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Jun 84 14:07:08 PDT
Date: Wed 20 Jun 84 14:06:27-PDT
From: Don Walker <WALKER@SRI-AI.ARPA>
Subject: Re: On-line abstract/library report
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: JMC@SU-AI.ARPA, Genesereth@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Mannuck@SU-SCORE.ARPA, Amsler@SRI-AI.ARPA, Feinler@SRI-NIC.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Tue 19 Jun 84 09:28:46-PDT
The Mannuck/Mazzetti report is a remarkably thorough treatment of the
problems in establishing bibliographic and full-text services for the
AI literature. I will make a few comments about particular points
before responding to the questions at the beginning.
First, the copyright issue is, as noted, a most complex one. However,
whether or not AAAI possesses the copyright by permission of the
contributors to the proceedings and to AI Magazine, it does satisfy
one of the conditions for copyright by having included a copyright
"claimer" in all of its issues. As a result, we have first right for
the contents of those documents--at least in that form. Further, as
I understand copyright law, to the extent that other copyrights have
not been taken out on those materials, we do have the right to use
them--as does everyone else, their being the public domain. I agree
that we should try to establish our copyRIGHT more clearly, but we
are not in such bad shape as the report suggests.
As for classification schemes, the CR categories are poor. I helped
Dave Waltz with the Comtex ones, and I had occasion to talk to Phoebe
Huang this morning about another matter, but the conversation led to
a consideration of the more widespread use of their classification
scheme. I argued that it would be in their interest to have people
use it throughout the community, and she agreed. However, she would
like a specific proposal in writing regarding such use, since it
will be a "copyrighted" entity.
Indexing speeds are not likely to be faster for AI subject indexers
than they are for NTIS personnel. It all depends on the relations
between depth and breadth of the classification systems in each and
on the relative sophistication of the classifiers. I would of course
like to argue for an approach to classification that makes use of
computational resources. Bob Amsler and I have been working toward
such a procedure. However successful we might prove to be, I would
like to argue for a methodology here that allows the incorporation
of more sophisticated techniques.
In fact, more generally, it seems to me essential for us as the
AI community to make available the resulting database as a resource
for research. I think we can control the distribution to preclude
the likelihood of untoward lossage. Going further, I would like
to argue, again, for an approach to ARPA (or some other funding
agency) that stresses the two-pronged nature of this enterprise.
We want to create an information source, but we want to ensure that
we are simultaneously working toward a means of exploiting it that
justifies the subject matter. Bob Amsler and I would like to
continue to be deeply involved in this enterprise, even as we move
to Bell Communications Research (Bob is joining me, and we will
both be there effectively in August--modulo the adjustments required
to cope with the transition). Furthermore, we are willing to provide
substantial local resources to support this measure. An ARPANET
connection to Bellcore (the official abbreviation) and access to the
data are the essential requirements. Bob and I are likely to be
involved with Dana Scott in the development of his Center for
Applied Logic at CMU in parallel ways.
In response to the questions, then:
* Should the AAAI act as an operator of such a service or
just fund the building of the database (db)?
I think the AAAI should act as a catalyst to ensure the development of the
service and the building of the database. It should be intimately involved
but not as either operator or builder
* Should the AAAI buy time at a local SU computer if it
does decide to operate this service?
This question cannot be addressed before some of the other questions are
resolved.
* Should the AAAI prepare a proposal for DARPA support?
AAAI should cooperate in the preparation of a proposal for submission to
ARPA. However, other groups should also be included, for example, the NIC
at SRI and Bellcore. Determining the participants is a more complex issue
that needs much more discussion.
* What are the copyright issues as it relates to full text
and abstracts? Does the AAAI possess the copyright to its own
publications?
I have treated some aspects of the copyright issue above; we need both to
explore it more fully and to get the advice of legal counsel, particularly
with regard to past publications. Certainly, we want to require/request
transfer of copyright from contributors more systematically.
* What anticipated problems should we expect from the publishers
when trying to license the use of copyrighted works on-line?
The publishers are, of course, trying to protect their resources and rights.
To the extent that we function on the bibliographic level, I think we can
be assured of cooperation. In that arena, we draw attention to their
publications and expand sales. As we begin to compete by providing
full-text services, we certainly will lose some cooperation. Again, that
depends on whether the publishers themselves intend to offer that service.
If they make use of DIALOG or some other vendor, we could probably get
access to their materials in similar ways. So much depends on how the
industry as a whole begins to face these issues.
* What are the start-up costs for a full text or abstract service
operated or supported by the AAAI?
The data presented in the report itself provides a more thorough treatment
than anything else I know of. We should attempt to refine it further, but
it should be a good beginning.
* How do you handle keywords and mathematical notations?
Keywords, I think we can cope with. Again, Amsler and I are working on
techniques to identify the distinguishing words and phrases that
characterize a set of documents that are grouped in a particular category
or classification niche. In effect, we want to derive from the full-text
the same kind of term assignment that an author or a good editor can do.
Here the critical issue, as I mentioned before, is establishing a philosophy
that will allow us to introduce progressively more sophisticated automation.
-------
∂20-Jun-84 1742 BSCOTT@SU-SCORE.ARPA Weening's Office, MJH 353
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jun 84 17:42:35 PDT
Date: Wed 20 Jun 84 17:39:43-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Weening's Office, MJH 353
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, Gene wonders whether 353 might be available for one of his visitors this
summer since Joe Weening will not be around.
Betty
-------
∂21-Jun-84 0316 TARNLUND@SRI-AI.ARPA foolog
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Jun 84 03:16:49 PDT
Date: Thu 21 Jun 84 03:17:20-PDT
From: ken@mit-mc
Subject: foolog
Sender: TARNLUND@SRI-AI.ARPA
To: jmc@SU-AI.ARPA
Reply-To: TARNLUND@SRI-AI.ARPA
Martin said that he is sending you a copy of the article about this version of Foolog.
; ---------- Small Prolog Interpreter (c) 1984 Martin Nilsson
; This is a small structure sharing Prolog interpreter, written
; for demonstrational purposes. A brief description of it can be
; found in Campbell, J.A. (ed.): "Implementations of Prolog"
; (published by Ellis Horwood 1984).
(defun xpr (x) (cadr x))
(defun lvl (x) (car x))
(defun molec (x y) (list x y))
(defun bind (x y env) (cons (cons x y) env))
(defun bond (x env) (cdr (or (assoc x env) '(nil))))
(defun but-first-goal (x) (cons (cdar x) (cdr x)))
; ---------- Prolog interpreter
(defun prove fexpr (goals)
(seek (list goals) '(0) '((bottom-of-env)) 1))
(defun seek (to-prove nlist env n)
(cond ((null to-prove) (apply *toplevel* (list env)))
((null (car to-prove)) (seek (cdr to-prove) (cdr nlist) env n))
((and (atom (car to-prove)) (null (var (car to-prove))))
(apply (car to-prove) (list (cdr to-prove) nlist env n)))
((loop with goalmolec = (molec (car nlist) (caar to-prove)) and
rest = (but-first-goal to-prove) and env2 = nil and tmp = nil
for (head . tail) in *database* do
(and (setq env2 (unify goalmolec (molec n head) env))
(setq tmp (seek (cons tail rest) (cons n nlist) env2 (add1 n)))
(return (and (null (equal tmp n)) tmp)))))))
(defun unify (x y env)
(cond ((equal (setq x (lookup x env)) (setq y (lookup y env))) env)
((var (xpr x)) (bind x y env))
((var (xpr y)) (bind y x env))
((or (atom (xpr x)) (atom (xpr y)))
(and (equal (xpr x) (xpr y)) env))
((setq env (unify (molec (lvl x) (car (xpr x)))
(molec (lvl y) (car (xpr y))) env))
(unify (molec (lvl x) (cdr (xpr x)))
(molec (lvl y) (cdr (xpr y))) env))))
(defun lookup (p env)
(or (and p (var (xpr p)) (lookup (bond p env) env)) p))
(defun var (p) (member p '(?a ?b ?c ?x ?y ?z ?u ?v ?w)))
; ---------- Evaluable Predicates
(defun inst (p env)
(cond ((atom (xpr (setq p (lookup p env)))) (xpr p))
((cons (inst (molec (lvl p) (car (xpr p))) env)
(inst (molec (lvl p) (cdr (xpr p))) env)))))
(defun escape-to-lisp (to-prove nlist env n)
(and (setq env (unify (molec (car nlist) '?y)
(molec n (eval (inst (molec (pop nlist) '?x) env)))
env))
(seek to-prove nlist env (1+ n))))
(defun cut (to-prove nlist env n)
(or (seek to-prove (cdr nlist) env n) (cadr nlist)))
(defun bagof-topfun (env) (push (inst (molec *be* '?x) env) *bl*) nil)
(defun bagof (to-prove nlist env n)
(let ((*bl*) (*be* (car nlist)))
(let ((*toplevel* 'bagof-topfun)) (seek '(((call ?y))) nlist env n))
(and (setq env (unify (molec (pop nlist) '?z) (molec n *bl*) env))
(seek to-prove nlist env (1+ n)))))
; ---------- Setting up the data base
(setq *database*
'(((true))
((= ?x ?x))
((append nil ?x ?x))
((append (?x . ?y) ?z (?x . ?u)) (append ?y ?z ?u))
((father medium-ben small-ben))
((father big-ben medium-ben))
((grandfather ?x ?y) (father ?x ?z) (father ?z ?y))
((call ?x) ?x))
*toplevel*
'(lambda (env) env))
(setq *database*
(append *database*
'(((escape-to-lisp ?x ?y) . escape-to-lisp)
((cut) . cut)
((bagof ?x ?y ?z) . bagof)
((writeln ?x) (escape-to-lisp (progn (prin1 '?x) (terpri)) ?y))
((cannot-prove ?x) (call ?x) (cut) (fail))
((cannot-prove ?x) (true))
((list-of-sons ?x) (bagof ?y (father ?z ?y) ?x))))
*toplevel*
'(lambda (env) (princ "MORE? ") (null (read))))
; ---------- Sample Run
; 4← (prove (append ?x (a b c) ?z) (writeln (?x on (a b c) is ?z)))
; (NIL ON (A B C) IS (A B C))
; MORE? t
; ((?X) ON (A B C) IS (?X A B C))
; MORE? t
; ((?X ?X) ON (A B C) IS (?X ?X A B C))
; MORE? nil
; T
; 5← (prove (list-of-sons ?x) (writeln (some sons are . ?x)) (fail))
; (SOME SONS ARE MEDIUM-BEN SMALL-BEN)
; NIL
; 6←
-------
∂21-Jun-84 0800 JMC*
air ticket and car rental
∂21-Jun-84 0800 JMC*
gas,reddy,cleaning
∂21-Jun-84 0800 JMC*
Griffiths
∂21-Jun-84 0935 BONNETAIN@SU-SCORE.ARPA re: softwar, a new weapon to deal with the Soviets ? (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Jun 84 09:34:51 PDT
Date: Thu 21 Jun 84 09:33:50-PDT
From: Jean-Luc Bonnetain <BONNETAIN@SU-SCORE.ARPA>
Subject: re: softwar, a new weapon to deal with the Soviets ? (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: BONNETAIN@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 21 Jun 84 02:40:00-PDT
First, let me say that the magazine from which i translated the article is a
serious one, not a National Enquirer type. So i don't believe that a serious
magazine like that would print "a work of imagination" without making it plain.
As to the existence of the book itself, they say it is "forthcoming". I'll be
going to France at the end of the summer quarter, and i'll try to find it.
As to Richard's mention of bringing down the network, i wonder if that wouldn't
be even worse for communications in case of a real war. Maybe the whole idea of
softwar is to scare people so much that they'll actually bring down important
capabilities for fear of having been penetrated. But Richard has taken the
idea from J. Brunner, and *this* is science fiction.
jlb
-------
∂21-Jun-84 1306 AAAI-OFFICE@SUMEX-AIM.ARPA additional agenda items
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Jun 84 13:06:07 PDT
Date: Thu 21 Jun 84 12:52:20-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: additional agenda items
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, Bledsoe@UTEXAS-20.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Here are some additional agenda items:
* Conference Program - Ron Brachman
* Tutorial Program - Doug Lenat
* Membership - Bruce Buchanan
* Publications - Lee Erman or Bob Engelmore
(we can discuss the AI Magazine and any ideas about new publications)
* Conference - Marty Tenenbaum
(we can discuss '87 sites and beyond)
Claudia
-------
∂21-Jun-84 1343 ATP.BLEDSOE@UTEXAS-20.ARPA Re: additional agenda items
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 21 Jun 84 13:42:52 PDT
Date: Thu 21 Jun 84 15:41:38-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: additional agenda items
To: AAAI-OFFICE@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
cc: Bledsoe@UTEXAS-20.ARPA, ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Thu 21 Jun 84 15:06:55-CDT
Claudia,
The Agenda you sent earlier seem Ok to me for my part of the meeting,
but I will have to do some more talking with various people ahead of time.
Basically I can handle any items left over after the transfer of
Presidency.
Woody
-------
∂21-Jun-84 1716 BSCOTT@SU-SCORE.ARPA Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Jun 84 17:16:23 PDT
Date: Thu 21 Jun 84 17:15:34-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Secretary
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, are you interested enough in any of the three applicants to warrant
reference checks. I think the first applicant, Gertrud, would be a good
secretary, but I understand that she may not be willing to change from a
35 hour week to a 40 hour week, which is the standard Stanford work-week.
However, I have not pursued this with her (Fran told me about the 35 versus
the 40 hour week), but she says she wants to work at Stanford and Stanford
has a 40 hour week.
Anyway, let me know. Fran now says that she has to be off a few days in
early July, but that she can continue until later in July if we need her.
I can place another ad in the paper if you want me to do this.
Betty
-------
∂22-Jun-84 0357 @MIT-ML:DLW@SCRC-TENEX Dialnet
Received: from MIT-ML.ARPA by SU-AI.ARPA with TCP; 22 Jun 84 03:57:05 PDT
Date: 22 Jun 1984 0703-EDT
From: Daniel L. Weinreb <DLW%SCRC-TENEX@MIT-ML>
Subject: Dialnet
To: jmc@SU-AI
cc: cwh%SCRC-TENEX@MIT-ML, dang%SCRC-TENEX@MIT-ML, hornig%SCRC-TENEX@MIT-ML,
mmcm%SCRC-TENEX@MIT-ML, garren%SCRC-TENEX@MIT-ML,
spoerl%SCRC-TENEX@MIT-ML
As far as I know, there isn't an item on the price list for upgrading from
the old modem to the new modem. I'm not sure, though. However, if you
buy a new modem, I don't think there is any technical problem with hooking
it up to an old 3600, nor are there any problems with the software. I
presume you're interested in this because you want to run at a higher bit
rate; with the old modem, you can still send mail to everybody, inclujding
new 3670 sites, with no problem.
The new modem is the Concord Data Systems Inc 224 Autodial Modem. We
usually just call it the CDS modem. It can do 2400 baud; it is CCITT
compatible (V.24, V.28, V.54, V.22bis). It also does Bell 212A
(1200 baud), and for the first cut, our Dialnet will probably always
only use 1200 baud, so that the CDS sites and Vadic sites can talk.
Eventually, connections between pairs of CDS sites will talk 2400 baud.
Our protocols are unrelated to Crispin's stuff. We have our own
low-level ("Dialnet") protocol for turning a phone line into a
reliable, flow-controlled byte-stream, and then on top of that
I belive that we use the standard Arpanet mail protocol (SMTP),
although I could be wrong.
The 9600 baud modem sounds interesting. I notice that the piece
of mail you sent me was dated the 21st, but the talk was on the
20th. Did you go to it? Are they for real? If we want to get
in touch with them, where do we find them -- like, do you know what
city Gamma Technology is in? Thanks.
-------
∂22-Jun-84 0625 AMAREL@RUTGERS.ARPA Re: workshop
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 22 Jun 84 06:25:14 PDT
Date: 22 Jun 84 09:24:47 EDT
From: AMAREL@RUTGERS.ARPA
Subject: Re: workshop
To: JMC@SU-AI.ARPA
cc: AMAREL@RUTGERS.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of 18 May 84 22:31:00 EDT
John, I have just returned from a trip abroad, and read your msg re Workshop
only now. What is this Workshop? My home number is 609-921-8842; my office
number is 201-932-3546. However, I will not be reachable in these numbers
from June 23 to July 2 (another trip); but I will be reading my electronic
mail during that time.
Regards, Saul
-------
∂22-Jun-84 0632 @MIT-ML:GARREN%SCC-WAIKATO@MIT-MC Homebrew Computer Club Meets 6/20
Received: from MIT-ML.ARPA by SU-AI.ARPA with TCP; 22 Jun 84 06:32:50 PDT
Received: from SCC-YELLOWSTONE by SCC-WAIKATO via CHAOS with CHAOS-MAIL id 37112; Fri 22-Jun-84 09:33:32-EDT
Date: Fri, 22 Jun 84 09:33 EDT
From: <GARREN%SCC-WAIKATO@MIT-MC.ARPA>
Subject: Homebrew Computer Club Meets 6/20
To: John McCarthy <JMC@SU-AI.ARPA>
In-reply-to: The message of 21 Jun 84 22:28-EDT from John McCarthy <JMC at SU-AI>
Date: 21 Jun 84 1928 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Here is an item that might interest you. I have some questions about
the Symbolics Dialnet. Will old 3600s be upgradable to your new modem?
What is the name of the new modem? Does your Dialnet follow the Crispin
protocols or is it entirely new?
The sex of the connectors for the serial ports have changed from the
3600 to the 3670 with the 3670 being more industry standard male. I
expect that means the cable supplied with the new modem is the wrong sex
for the 3600. Other than that the new modem will work fine. The new
modem is available for sale seperately and could be ordered for
upgrading 3600's.
∂22-Jun-84 0821 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Jun 84 08:21:41 PDT
Date: Fri 22 Jun 84 08:08:59-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 21 Jun 84 17:18:00-PDT
I'll check references on Gertrud, and will offer her the position if references
are o.k. Will let you know the outcome.
Betty
-------
∂22-Jun-84 0844 RWW CLT
DO YOU KNOW IF SHE IS COMING IN TODAY. COULD YOU HAVE HER CALL?
THANKS
RICHARD
∂22-Jun-84 1808 AMSLER@SRI-AI.ARPA Comments on `On-line abstract/library report'
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 22 Jun 84 18:07:52 PDT
Date: Fri 22 Jun 84 18:06:58-PDT
From: Robert Amsler <AMSLER@SRI-AI.ARPA>
Subject: Comments on `On-line abstract/library report'
To: aaai-office@SUMEX-AIM.ARPA
cc: mannuck@SU-SCORE.ARPA, buchanan@SUMEX-AIM.ARPA, genesereth@SUMEX-AIM.ARPA,
jmc@SU-AI.ARPA, walker@SRI-AI.ARPA
Comments on: "Findings and Recommendations for an On-Line
Bibliographic Abstract/Library Service"
Robert A. Amsler
Re: Copyrights for abstracts, keywords, classification indexing
It is my understanding that db creators are protected from use of
these information items. The rule of thumb is that if they expended
paid labor to have these items created, i.e. paid an
abstracter/indexer to provide this information, that their investment
is protected by coypright.
It appears to have generally been decided that pure bibliographic
information, short of any value-added work of the db creator, is not
copyrightable. I.e. title, author, source, etc. I.e. the information
you would expect to find in a paper's bibliography.
Re: "The Big Three".
This is somewhat misleading. MONITOR (Oct., '83) reports that two of
the database vendors, Mead Data Central (NEXIS/LEXIS) and Dialog
account for 81.81% ($105M) of the total revenue and 68.56% of the
total usage in the on-line database industry. Mead may have not been
listed in the ``big three'' because they aren't a bibliographic entry
vendor, only dealing with the distribution of full-text. Mead,
Dialog, NLM, BRS, SDC and The New York Times (in that order) accounted
for 98.03% of the revenue and 96.54% of the connect time used. NYTimes
has since given up themselves and Mead Data Central now handles their
data. SDC and BRS are believed to have yearly revenues of only about $10M
together. It sounds more like `the big two' to me.
Re: builders of databases. Three dbs account for 49.72% of the revenue
($64 million). Mead Data Central, Chemical Abstracts Service and the
National Library of Medicine.
Re: an AI Classification System
I agree with Don Walker. There isn't an adequate classification
system for AI. I believe no ONE person could devise such an adequate
classification system. A set of people, knowledgeable in their
separate fields, would be needed. I think the Robotics example is in
fact the situation in many of the fields, i.e. there are considerable
expansions of the classification system needed for each sub-area
listed. Townley & Gee (Thesaurus-Making: Grow Your Own Word Stock,
pub. Andre Deutsch, 1980) suggests somewhere between 500-2000 terms
for a typical thesaurus. My own guess would be that there should be as
many terms in the thesaurus as there are books in the field.
I also agree with Don that there is little reason to believe AI
indexers would take less time than indexers in other fields.
Re: Abstracts. From my own experience in composing abstracts for the
University of Texas' CS Dept. technical reports, the abstract is
typically pulled from the first couple paragraphs of the text of a TR.
My ARIST chapter styleguide indicates that,
``You are required to obtain permission to quote material that
exceeds six lines''
I would assume such a rule also applies to composition of abstracts.
One note: The Kurzweil omni-font OCR system has been successfully used
to add abstracts to bibliographic records by copying them from the
journal in which they appear, given the machine-readable bibliographic
details of the document have already been obtained. Bell
Communications Research is ordering a Kurzweil for our research lab,
such that this would be feasible. They are inexpensive (est. $44K)
and access to one could be obtained from other sources as well, but
this is one aspect of the work that could be done by Bellcore with our
supervision.
Re: On-Line Full Text Service
The electronic publishing literature (MONITOR, for instance) has
recently reported on ISI (Information Sciences Institute, (Garfield's
citation outfit in Philadelphia)) withdrawing two of their on-line dbs
for lack of usership. This is seen, in conjunction with the New York
Times' abandonment of their own marketing of the NYTimes databank to
Mead Data Central, as evidence that even major publishers will not be
able to sell their own db services, but forced to resort to pooling
their information with a major vendor's collection (e.g. Dialog's).
The reason seems to be that very few users want to buy access to more
than 2-3 databases or learn how to use more than that number of
interfaces. Hence, there is little likelihood a publisher such as
Elsevier-North Holland will be marketing their own data for long.
On the basis of this trend, I'd suggest AAAI NOT plan on operating its
own service, but plan on becoming part of a large vendor's collection.
Re: Current Full-Text Services (L.C. report)
Among the major interests I expect to have at Bell Communications
Research is the exploration of methods for access to illustrative
materials in documents (i.e. electronic publishing). Since I am also
interested in monitoring the AI literature I would be willing to
consider making the AAAI database effort a test case for the
development of a full electronic text distribution system, perhaps
based on the MacIntosh as a low-cost graphics terminal to be used to
view articles including their photographs and illustrations.
I also intend to make use of Bellcore's closer proximity to the New
York City publishing houses to find out what they are doing in
electronic publishing, esp. for more advanced full-color photography
through digital imagery. Mead Data Central is building its full-text
database by approaching publishers with low-cost offers to market
their `unwanted' electronic text, often seen by the publishers as a
left-over by-product of computer photocomposition. I believe the
potential for access to publications switching to digital imagery for
publications is open.
The above paragraph means that if AAAI should decide to have Bellcore
as a collaborator, we might well be able to develop a next generation
full-text db technology based upon the AI literature as a starting
point. Specifically, a technology for the low-cost home access to
journals and books with accompanying photographic or illustrative
materials. Bellcore is also working on testing of a 9600 Baud fiber
optic phone net for home computer access.
Re: Copyrights
As mentioned in the beginning of this commentary, copyright permission
IS NOT REQUIRED for straight bibliographic information. In this regard
it might be that AAAI wants to build a complete bibliographic DB for
AI as a first task, and approach the task of acquiring/augmenting this
collection with abstracts and full-texts during a second pass.
Re: Mead Data Central's NEXIS charging
Mead Data Central's NEXIS (full-text) charging policy includes a cost
per line minute as well as a cost per query. There is, however, no
cost per entry transmitted. Dialog (largely just bibliographic
information) charges per line minute and per document found, but
doesn't charge for queries. The difference here seems to reflect the
goal of obtaining a certain average income per hour of use of the
system based upon the differences between the speed of access and the
size of data items being retrieved.
Re: Points not addressed.
Loss of Revenue to AAAI/ACL/etc. through availability of full-text
access to their proceedings/publications.
It is also an established fact that revenue losses from sales of the
printed copies of publications occurs when electronic access is
provided. The electronic publishing literature contains articles
discussing how to estimate the magnitude of this loss.
Re: ACS and OCR entry
First, ACS evaluated OCR entry in the past, not at today's data entry
prices and OCR system costs. Second, I tend to agree that chemical and
mathematical notation would be very difficult to enter via OCR system,
but the AI literature is more heavily text oriented and it may be
possible to digitize portions of documents rather than enter them as
characters (This does have the drawback that one can't do searching
on the digital information).
The AMS (American Mathematical Society) has adopted TeX for its
publications. There also seems to be a general agreement that
spelling-out is an acceptable method of replacement for non-ASCII
symbols (e.g. square-root pi times delta epsilon).
Bob Amsler
-------
∂22-Jun-84 2237 CLT if
you didn't already do it, it would be good to take out
the garbage and all the fishy pans and foil - thanks
∂25-Jun-84 1456 HOBBS@SRI-AI.ARPA Talk by Pat Hayes and Meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 25 Jun 84 14:56:13 PDT
Date: Mon 25 Jun 84 14:55:23-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Talk by Pat Hayes and Meeting
To: commonsense@SRI-AI.ARPA
Pat Hayes will give a talk on "Histories" tomorrow Tuesday, June 26, at
2 pm in EK242 at SRI.
There will be a general meeting of the Commonsense Summer people Wednesday
morning at 10 am usual place. We'll start discussing some of the steps
toward axiomatization that have been taken in some of the domains.
-- Jerry
-------
∂25-Jun-84 1558 RPG ARPA
Can you keep wed July 11 open for a possible meeting with Kahn, Burton
Smith, and Squires in Washigton? Smith is trying to set it up and will get
back to us.
-rpg-
∂25-Jun-84 2027 FEIGENBAUM@SUMEX-AIM.ARPA [Rose Peet <rose@rochester.arpa>: Very High Performance Computing]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Jun 84 20:26:53 PDT
Date: Mon 25 Jun 84 17:50:12-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Rose Peet <rose@rochester.arpa>: Very High Performance Computing]
To: nii@SUMEX-AIM.ARPA, delagi@SUMEX-AIM.ARPA, brown@SUMEX-AIM.ARPA,
rpg@SU-AI.ARPA, jmc@SU-AI.ARPA
This came from Jerry Feldman last week. Do we want to make any kind of response?
Ed
-------------------------------------------
---------------
Return-Path: <rose@rochester.arpa>
Received: from ur-cayuga.rochester.arpa (ROCHESTER.ARPA.#Internet) by SUMEX-AIM.ARPA with TCP; Mon 18 Jun 84 12:48:20-PDT
Received: from ur-seneca.rochester.arpa (ur-seneca) by ur-cayuga.rochester.arpa id AA00132 (4.12dd); Mon, 18 Jun 84 15:40:21 edt
Received: by ur-seneca.rochester.arpa id AA24515 (3.327.5d); 18 Jun 84 15:47:53 EDT (Mon)
Message-Id: <8406181947.24515@ur-seneca.rochester.arpa>
Date: 18 Jun 84 15:47:53 EDT (Mon)
From: Rose Peet <rose@rochester.arpa>
Subject: Very High Performance Computing
To: ai-group@rochester.arpa
Cc: Others@rochester.arpa
Dear Colleague,
As you may know, George Keyworth is appointing a panel to advise
on very high performance computing. Unaccustomed as I am to being considered
a leader of AI, that appears to be the situation here.
---------------------
--------------------
From: ICS.BROWNE@UTEXAS-20.ARPA
Subject: A Committee for a National Policy on Research and Development on Very High Performance Computing
To: feldman@SUMEX-AIM.ARPA
I have been asked by the Office of Science and Technology Policy to form a
committee to come up with a national requirements statement for research
and development in very high performance computing. The charge for this
committee is: 1) to develop a requirements statement for a nationwide
policy and requirements statement on research and development in very high
performance computing, 2) to assess existing programs of the agencies
concerned with very high performance computing, 3) to map the requirements
statement against existing programs to determine gaps which may exist and
to recommend allocation of responsibilities for uncovered research and
development, and 4) to support OSTP in implementation of these requirements
in terms of policy and funding.
One of the viewpoints I bring into such a committee is the really important
need for having representation by application areas as well as architects,
software, and technology people. Clearly, you would be a marvelous repre-
sentative for the artificial intelligence community on such a committee.
I realize that you have served your turn on national committees. On the
other hand, your degree of success in service on national committees also
argues for continuing this service. Your name has been suggested by a
number of distinguished people in the areas as the ideal representative
for AI. Please give me a call or send me an Arpanet message if you want
further information or you want to discuss this before volunteering.
-------
-------
There is no way to predict how seriously the committee will be taken,
but it could be important. It would be very helpful if you could send me
your ideas on the amount and nature of very high performance computing
needed for AI; text suitable for inclusion in a report would be especially
welcome. This could also be viewed as an opportunity for the AI community
to demonstrate the technical leadership we have often claimed.
Jerry Feldman
-------
∂26-Jun-84 1331 OHLANDER@USC-ISI.ARPA FY 85 Incrementals
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 26 Jun 84 13:30:59 PDT
Date: 26 Jun 1984 16:30-EDT
Sender: OHLANDER@USC-ISI.ARPA
Subject: FY 85 Incrementals
From: OHLANDER@USC-ISI.ARPA
To: Zue@MIT-MC.ARPA
To: TOB@SU-AI.ARPA, Nevatia@USC-ECL.ARPA, Fischler@SRI-AI.ARPA
To: Kanande@CMU-CS-A.ARPA
To: Wiederhold@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA
To: JMC@SU-AI.ARPA, Kender@COLUMBIA-20.ARPA, Lebowitz@COLUMBIA-20.ARPA
To: Wilensky@UCB-VAX.ARPA, Green@KESTREL.ARPA, Schank@YALE.ARPA
To: McDermott@YALE.ARPA, Stan@SRI-AI.ARPA, Adams@USC-ISI.ARPA
To: MLD@MIT-ML.ARPA, Garvey@SRI-AI.ARPA, BALZER@ISI-VAXA.ARPA
To: PHW@MIT-MC.ARPA, Talbert@RAND-UNIX.ARPA, Lesser.umass-cs@UDEL-RELAY.ARPA
To: Riseman.umass-cs@UDEL-RELAY.ARPA, Hope%cvl.arpa@CSNET-RELAY.ARPA
Cc: Ohlander@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA]26-Jun-84 16:30:32.OHLANDER>
Gentlemen:
The time has come to initiate actions for FY 85
incremental funding. Accordingly, I need 4 or 5 items of
accomplishment for the past year of research and 4 or 5
objectives for FY 86 research. These should be brief bullets.
Provide accomplishments from the perspective of the end of the
fiscal year, i.e., list anything that your reasonably expect to
accomplish by the end of September. Please send these to me by
net mail by the 6th of July. I need accomplishments and objectives
for each major effort that DARPA is funding at your institution.
Samples of the kind of information that I want are shown below.
Ron Ohlander
********************************************************************
Accomplishments to Date:
Conducted survey of research institutions conducting research in
Autonomous Vehicles for the purpose of the determining extent of
research being conducted in the area and the kinds of vehicles
available.
In conjunction with Westinghouse and NVL, completed preliminary
design of a vehicle system to be utilized in the research
program.
Performed a kinematic analysis of structure and motion from
optical flow.
Developed optical flow field smoothing and multi-resolution
techniques.
FY84 Objectives:
Complete the vehicle system assembly and determine a vehicle task
formulation. Analyze the information flow of the vehicle system.
Develop image understanding techniques for determining optical
flow parameters from image deformation.
Develop a time-dependent differential geometry for structure and
motion analysis.
Develop active and passive ranging algorithms for vehicle
navigation.
Accomplishments to Date:
Finished coding of low-level (point-object) SPAM modules and
debugging is underway.
Coded Davis's FISHNET spatial representation (now called
MERCATOR). Acquired and assembled Heathkit robot to serve as
testbed and completed modifications to allow communication with
Apollo computer.
Conducted further research on logic for time and problem solving
aspects of robotic functioning. Developed techniques for
scheduling of mobile robot activities.
Completed and debugged modules for handling data-dependencies
("truth maintenance") on numerical assertions.
FY84 Objectives:
Complete design of a two-level space-time map (a time map which
includes facts from a spatial map), to allow reasoning about
motion. This will use the SPAM data base.
Complete the implementation of the revised SPAM system.
Implement two-level space-time map. Study applying
MERCATOR-style methods to three-dimensional objects.
Connect problem solver to space-time map, so it can create and
execute plans involving motion.
∂26-Jun-84 1337 GROSOF@SU-SCORE.ARPA martin davis
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Jun 84 13:37:49 PDT
Date: Tue 26 Jun 84 13:34:39-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: martin davis
To: jmc@SU-AI.ARPA
David Etherington has asked me if I (don't) or you know where Martin Davis
is these days. Can you send me his address if you have it so I can forward
it?
Benjamin
-------
∂26-Jun-84 1508 DFH
To: JMC, DFH
Please call Gerald Halpern. Office: 408 256 4701 or Home: 408 255 3372
∂27-Jun-84 0906 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Jun 84 09:06:16 PDT
Date: Wed 27 Jun 84 09:10:01-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: commonsense@SRI-AI.ARPA
There will be a general meeting of the Commonsense Summer people this
morning at 10 in the usual place, EK242 at SRI. We will begin to discuss
the content of various domains.
The <COMMONSENSE> directory will be used for various write-ups, progress
reports, axiomatizations, and half-baked ideas. If you have something
you would like to add to the directory, feel free to do so.
-- Jerry
-------
∂27-Jun-84 0949 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, June 29, 1984.
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Jun 84 09:48:53 PDT
Date: Wed 27 Jun 84 09:46:18-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, June 29, 1984.
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, June 29, 1984
LOCATION: Chemistry Gazebo, between Organic & Physical Chemistry
TIME: 12:05
SPEAKER: Steven Rosenberg
Hewlett-Packard Research Laboratories
Palo Alto
TOPIC: Expert Systems at Hewlett-Packard
ABSTRACT:
The Applications Technology Laboratory of HP Labs is engaged in
developing "industrial strength" AI. As part of its contribution to
this effort, the Expert Systems Department has engaged in various
"experiments" to develop expert system prototypes. One such
experiment involved the development of PICC, an expert system for
diagnosing flaws in IC wafers during negative photolithography. This
talk will discuss the development and status of PICC. Besides
describing the technical aspects of PICC, I will explore some of the
issues involved in conducting expert systems experiments: why was
photolithography chosen as a good area to apply expert systems
technology; what were the pitfalls in moving PICC from a laboratory
environment into a real fab line; even if it works, is it useful?
-------
∂27-Jun-84 1043 SJG nonmonotonic workshop
To: reiter@RUTGERS.ARPA
CC: JMC@SU-AI.ARPA
I haven't heard so much as a peep about the paper I submitted --- any hint
as to what this means? Thanks.
Matt Ginsberg
∂27-Jun-84 1419 STAN@SRI-AI.ARPA Student potentially interested in CBCL
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Jun 84 14:19:38 PDT
Date: Wed 27 Jun 84 14:23:46-PDT
From: STAN@SRI-AI.ARPA
Subject: Student potentially interested in CBCL
To: jmc@SU-AI.ARPA
cc: stan@SRI-AI.ARPA
John, there is a student visiting from Israel by the name of
Tsippi Gonczarowski, who is interested in consensus formation
between multiple agents who pass around symbolic formulas, etc.
This reminded me of you interest in CBCL. Do you have any material
I could give her on the subject? Thanks. --Stan
-------
∂28-Jun-84 0043 Tenenbaum@SRI-KL.ARPA Henry Firdman
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 28 Jun 84 00:43:08 PDT
Date: Thu, 28 Jun 1984 00:16 PDT
From: Marty Tenenbaum <Tenenbaum at SRI-KL>
To: McCarthy at SU-AI
Subject: Henry Firdman
John,
A chap by that name sent me a letter offering AI consulting services.
He claims to have been prominent in the USSR AI community and to have
founded and directed that nation's first national laboratory (in 1974).
Im afraid I've never heard of him. Have you?
Regards,
JMT.
∂28-Jun-84 1144 reiter%ubc.csnet@csnet-relay.arpa Re: nonmonotonic workshop
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 28 Jun 84 11:44:48 PDT
Received: From ubc.csnet by csnet-relay; 28 Jun 84 14:33 EDT
Received: from ubc-vision.UUCP (ubc-vision.ARPA) by ubc-ean.UUCP (4.12/3.14)
id AA22550; Thu, 28 Jun 84 11:25:46 pdt
Date: Thu, 28 Jun 84 11:25:17 pdt
From: Ray Reiter <reiter%ubc.csnet@csnet-relay.arpa>
Message-Id: <8406281825.AA20274@ubc-vision.UUCP>
Received: by ubc-vision.UUCP (4.12/3.14)
id AA20274; Thu, 28 Jun 84 11:25:17 pdt
To: reiter@rutgers.arpa, uw-beaver!SJG@su-ai.arpa
Subject: Re: nonmonotonic workshop
Cc: JMC@su-ai.arpa
The acceptance/rejection letters went ou3 days ago. I did receive your
submission.
∂28-Jun-84 1613 perlis@umcp-cs.arpa formula circumscription
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 28 Jun 84 16:13:41 PDT
Received: From umcp-cs.csnet by csnet-relay; 28 Jun 84 18:50 EDT
Date: 28 Jun 84 17:43:12 EDT (Thu)
From: Don Perlis <perlis@umcp-cs.arpa>
Subject: formula circumscription
To: jmc@su-ai.arpa
Cc: grosof@sumex-aim.arpa
John,
It seems to me now that you were right that my suggestion
for using set theory for circumscription over arbitrary formulas
has as its principle advantage that it is first order (and thereby
both computationally more tractable and also allowing truly arbitrary
formulas--e.g., even formulas applied to (quoted) formulas, assuming
the appropriate comprehension axioms are used).
It does not, contrary to my beliefs when I lectured at Stanford in
May, seem to handle the examples I presented then any better than
your own second-order treatment. That is, both treatments would
seem to suffice. My own version still is in extremely preliminary
form. I will let you know when I get more technical details to
communicate.
Best regards,
Don
∂28-Jun-84 1635 DFH
To: JMC, DFH
I will be back in the office on July 5.
∂02-Jul-84 0900 JMC*
Grove's dictionary, old messages
∂02-Jul-84 1150 RPG Smith/Kahn/Denelcorp
I'll leave the decision about when and how to meet with these guys
up to you. I slightly prefer to meet in Washington.
-rpg-
∂02-Jul-84 1154 BSCOTT@SU-SCORE.ARPA Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jul 84 11:54:00 PDT
Date: Mon 2 Jul 84 11:52:30-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Secretary
To: JMC@SU-AI.ARPA, Zm@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Well, Gertrud Pacheco won't be coming here after all. Her references all
checked out, but she has been unable to make arrangements for her young
daughter to accommodate the hours here. I am back working on trying to
get a secretary for you. Fran will be back on Thursday, and can stay until
the end of the month.
I'll keep you informed.
Betty
-------
∂02-Jul-84 1420 CWR
cwr - I need to ask you about your willingness to help with a recommendation.
Currently, I plan to leave for a trip to Cambridge
on July 14-18. Would it be possible to make an appointment
with you before the leave date?
∂02-Jul-84 1429 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jul 84 14:28:50 PDT
Date: Mon 2 Jul 84 14:19:59-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 2 Jul 84 13:41:00-PDT
I am sure that you could be happy with a set of hours different from 8:00 -
5:00. But with Gertrud there wasn't any schedule satisfactory to her where
the hours would equal 40 per week, and she did not want to work less than
full time.
Betty
-------
∂02-Jul-84 1433 BOSACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jul 84 14:33:33 PDT
Date: Mon 2 Jul 84 14:32:06-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 2 Jul 84 13:53:00-PDT
I'll send Chuck a message telling him we're interested. I'll let you know
what happens.
Len
-------
∂02-Jul-84 1508 ALPERT@SU-SCORE.ARPA model
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jul 84 15:07:00 PDT
Date: Mon 2 Jul 84 14:50:50-PDT
From: Jack Alpert <ALPERT@SU-SCORE.ARPA>
Subject: model
To: jmc@SU-AI.ARPA
John,
It appears that we are sending signal to you. You are not sending signal to
us. This means your modem is not sending or the telephone company is not
communicating it.
Using a house phone to test the circuit.
The system has two pair wires, red and green and yellow and black.
If you put the red and green lines of a house phone (used as a sensor) accross
one of the pairs at the wall socket.
If you hear a tone it is from us or your modem.
IF the tone is generated by your model it will stop when you unplug the modem.
This means that your set is sending and we are not hearing it and its the phone
company problem.
If it does not go away it means it is the signal we are sending and the modem
is not hearing. Your modem is broken.
If you don't hear a tone on the first pair either modem is not sending or the
signal we are sending is not getting thru. Check the other pair with the above
steps to to see which it is. If both pair are dead, both the phone company and
your modem have a problem.
If you want me to come out to your house to test it I will be happy to do so.
Just tell me when you want me to come.
Jack alpert Alpert@score 326-4416 home 497-1407 MJH 030c
-------
∂02-Jul-84 1620 BOSACK@SU-SCORE.ARPA Unix system programming service
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Jul 84 16:20:12 PDT
Date: Mon 2 Jul 84 16:19:14-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Unix system programming service
To: JMC@SU-AI.ARPA
Several folks (cheriton, lantz, oliger, knuth) have asked if we can
provide a Unix system programming service. If I understand what they want,
we would hire 1 or two bodies and provide service to the machines that
need it. We would charge them our average cost, about $8K for a 750,
$12K for a 780.
If we can do it on a economically sane basis, there seems to be a need
for the service.
If I get positive responses from the usual crowd, I'll draw up an
estimate budget. We should then be able to decide if we should proceed.
Len
-------
∂03-Jul-84 1005 BOSACK@SU-SCORE.ARPA Re: service for vaxen
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Jul 84 10:05:08 PDT
Date: Tue 3 Jul 84 10:03:57-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: service for vaxen
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 3 Jul 84 08:57:00-PDT
It looks like about 12 750s and 4 780s have some sort of interest. I'm still
stiring the budget numbers, but it looks like about $110K/year covers everything
I can think of. Administration of the machines was NOT included, just the
technical system programming part of the job. If someone wanted us to
do the whole job, I suppose we would be willing to quote a price.
(at the rates I proposed the income would be 8*12=96+4*12=48 = 144K. We
should be able to do the job for less. The actual charges would be whatever
the actual averaged turned out to be.)
Len
-------